#include <bits/stdc++.h>

#define F first
#define S second
#define MP make_pair
#define pb push_back
#define all(a) a.begin(), a.end()
#define lcm( a, b ) (a)/__gcd((a),(b))*(b)
#define endl '\n'

using namespace std;

typedef long long LL;
typedef pair< int, int > P;
typedef pair< LL, LL > LP;

static const int INF = INT_MAX;
static const LL LINF = LLONG_MAX;
static const int MIN = INT_MIN;
static const LL LMIN = LLONG_MIN;
static const int MOD = 1000000007;
static const int SIZE = 200005;

const int dx[] = {0, -1, 1, 0};
const int dy[] = {-1, 0, 0, 1};

LL fac[SIZE], finv[SIZE], inv[SIZE];
void combInit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for( int i = 2; i < SIZE; ++i ) {
        fac[i] = (fac[i - 1] * i) % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        finv[i] = (finv[i - 1] * inv[i]) % MOD;

    }
}

LL comb(int n, int k) {
    if( n < k ) return 0;
    if( n < 0 || k < 0 ) return 0;
    return (fac[n] * (finv[k] * finv[n - k] % MOD)) % MOD;

}

vector< int > Div( int n ) {
    vector< int > ret;
    for( int i = 1; i * i <= n; ++i ) {
        if( n % i == 0 ) {
            ret.pb( i );

            if( i * i != n ) ret.pb( n / i );
        }
    }
    sort( all( ret ) );
    return ret;
}

int kadomatsu(int a, int b, int c);

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int q;
    cin >> q;
    for( int i = 0; i < q; ++i ) {
        int a, b, c;
        cin >> a >> b >> c;
        int min_c = INF;

        swap(a, b);
        min_c = min(min_c, kadomatsu(a, b, c));
        swap(a, b);
        swap(b, c);
        min_c = min(min_c, kadomatsu(a, b, c));

        if( min_c == INF ) {
            cout << -1;

        } else {
            cout << min_c;

        }
        cout << endl;

    }
    return 0;
}

int kadomatsu(int a, int b, int c) {
    if( a < b && b < c || a > b && b > c ) {
        return 0;

    }
    if( a <= 2 && c <= 2 ) {
        return INF;

    }

    if( b == 1 ) {
        return INF;

    }
    if( a <= 2 && b <= 2 && c <= 2 ) {
        return INF;

    }

    if( a == b && b == c ) {
        return 3;

    }

    if( a == b ) {
        if( b < c ) {
            return 1;

        } else {
            if( a - c == 1 ) {
                return 2;

            } else {
                return 1;

            }
        }
    }

    if( b == c ) {
        if( a < b ) {
            if( b - a == 1 ) {
                return 2;

            } else {
                return 1;

            }
        } else {
            return 1;

        }
    }

    if( a < b && c < b ) {
        if( a == c ) {
            return b - a + 3;

        } else if( a < c ) {
            if( c - a == 1 ) {
                return b - c + 2;

            } else {
            }
        } else {
            if( a - c == 1 ) {
                return b - a + 2;

            } else {
                return b - a + 1;

            }
        }
    } else {
        if( a == c ) {
            return a - b + 1;

        } else if( a < c ) {
            return a - b + 1;

        } else {
            return c - b + 1;

        }
    }
}