#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int main(void) {
int n;
cin >> n;
int a;
int arr[101];
int count = 0;
int length;
int max, min;
for (int i = 0; i < n; i++) {
while (scanf("%d", &a) != EOF) {
arr[count] = a;
count++;
}
sort(arr, arr + count);
max = arr[count - 1];
min = arr[0];
printf("Class %d\nMax %d, Min %d, Largest gap %d\n", i+1, max, min, max - min);
for(int j=0; j<count; j++){
arr[j]=NULL;
}
}
return 0;
}
I2luY2x1ZGU8Y3N0ZGlvPgojaW5jbHVkZTxpb3N0cmVhbT4KI2luY2x1ZGU8YWxnb3JpdGhtPgojaW5jbHVkZTxjc3RyaW5nPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IG1haW4odm9pZCkgewoJaW50IG47CgljaW4gPj4gbjsKCglpbnQgYTsKCWludCBhcnJbMTAxXTsKCglpbnQgY291bnQgPSAwOwoJaW50IGxlbmd0aDsKCWludCBtYXgsIG1pbjsKCWZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJd2hpbGUgKHNjYW5mKCIlZCIsICZhKSAhPSBFT0YpIHsKCQkJYXJyW2NvdW50XSA9IGE7CgkJCWNvdW50Kys7CgkJfQoJCXNvcnQoYXJyLCBhcnIgKyBjb3VudCk7CgoJCW1heCA9IGFycltjb3VudCAtIDFdOwoJCW1pbiA9IGFyclswXTsKCQlwcmludGYoIkNsYXNzICVkXG5NYXggJWQsIE1pbiAlZCwgTGFyZ2VzdCBnYXAgJWRcbiIsIGkrMSwgbWF4LCBtaW4sIG1heCAtIG1pbik7CgkJCgkJZm9yKGludCBqPTA7IGo8Y291bnQ7IGorKyl7CgkJCWFycltqXT1OVUxMOwoJCX0KCX0KCglyZXR1cm4gMDsKfQo=