#include<bits/stdc++.h>
using namespace std;
#define getbit(n, i) (((n) & (1LL << (i))) != 0) 
#define setbit0(n, i) ((n) & (~(1LL << (i)))) 
#define setbit1(n, i) ((n) | (1LL << (i))) 

#define ll long long
#define int long long
template<typename s, typename t> void smax(s &a, const t &b) {if (a<b) a=b;}
template<typename s, typename t> void smin(s &a, const t &b) {if (a>b) a=b;}
char gap = 32;

#define rng_init mt19937 rng(chrono::steady_clock::now().time_since_epoch().count())
#define rng_seed(x) mt19937 rng(x)
#define fill(x, y) memset(x, y, sizeof(x))
#define srt(v) sort(v.begin(), v.end())
#define rsrt(v) sort(v.rbegin(),v.rend())
#define pb push_back
#define lll __int128_t
ll hashPrime = 1610612741;

int solve(int a, int b, int c) {
    int nums[3] = {a, b, c};
    sort(nums, nums + 3);
    
    int sml = nums[0];
    int mid = nums[1];
    int lrg = nums[2];
    
    int d1 = mid - sml;
    int d2 = lrg - mid;
    
    if (d1 == d2) {
        return d1; 
    } else if ((d2 - d1) % 2 == 0) {
        return d1 + (d2 - d1) / 2;
    } else {
        return d1 + (d2 - d1) / 2 + 2;
    }
}

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t; cin >> t;
    while (t--) {
        int A, B, C;
        cin >> A >> B >> C;
        cout << solve(A, B, C) << endl;
    }
}