#include int main(void) { int t; scanf("%d", &t); long int abcde[t][5]; long int num[t]; for (int i = 0; i < t; i++) { scanf("%ld %ld %ld %ld %ld", &abcde[i][0], &abcde[i][1], &abcde[i][2], &abcde[i][3], &abcde[i][4]); int max = 0; int min = 0; for (int j = 1; j < 5; j++){ if (abcde[i][max] < abcde[i][j]){ max = j; } if (abcde[i][min] > abcde[i][j]){ min = j; } } num[i] = abcde[i][max] - abcde[i][min]; } for (int i = 0; i < t; i++) { printf("%ld\n", num[i]); } return 0; }