#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define EPS (1e-7)
#define INF (1e9)
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define all(x) x.begin(),x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
const double PI = acos(-1);
const ll MOD = 1000000007;
// const ll MOD = 998244353;
template<class T>
inline bool chmax(T &a, T b) {
    if(a < b) {
        a = b;
        return true;
    }
    return false;
}
 
template<class T>
inline bool chmin(T &a, T b) {
    if(a > b) {
        a = b;
        return true;
    }
    return false;
}
///////////////////////////////////////////////////////////////

int f1(int A, int B, int C) {
    int res = 0;
    if (A>= B) {
        res += A-B+1;
        A = B-1;
    }
    if (C >= A) {
        res += C-A+1;
        C = A-1;
    }
    if (A <= 0 || C <= 0) return INF;
    return res;
}

int f2(int A, int B, int C) {
    int res = 0;
    if (C >= B) {
        res += C-B+1;
        C = B-1;
    }
    if (A >= C) {
        res += A-C+1;
        A = C-1;
    } 
    if (A <= 0 || C <= 0) return INF;
    return res;
}

int f3(int A, int B, int C) {
    int res = 0;
    if (A >= C) {
        res += A-C+1;
        A = C-1;
    }
    if (B >= A) {
        res += B-A+1;
        B = A-1;
    } 
    if (B <= 0 || A <= 0) return INF;
    return res;
}

int f4(int A, int B, int C) {
    int res = 0;
    if (C >= A) {
        res += C-A+1;
        C = A-1;
    }
    if (B >= C) {
        res += B-C+1;
        B = C-1;
    } 
    if (B <= 0 || C <= 0) return INF;
    return res;
}

int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int T; cin >> T;
    while (T--) {
        int A,B,C; cin >> A >> B >> C;
        int ans = INF;
        chmin(ans,f1(A,B,C));
        chmin(ans,f2(A,B,C));
        chmin(ans,f3(A,B,C));
        chmin(ans,f4(A,B,C));
        if (ans == INF) cout << -1 << endl;
        else cout << ans << endl;
    }
}