#pragma region
#pragma GCC target("avx2")
#pragma GCC optimize("03")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
using namespace std; typedef long double ld; typedef long long ll;
typedef unsigned long long ull;
#define endl "\n"
#define FOR(i,a,b) for(int i=(a);i<=(b);i++)
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define VPII vector<PII>
#define VPLL vector<PLL>
#define ALL(x) (x).begin(), (x).end()
constexpr int INF=1<<30; constexpr ll LINF=1LL<<60; constexpr ll mod=1e9+7; constexpr int NIL = -1;
template<class T>inline bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>inline bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
#pragma endregion
//-------------------

void solve() {
    ll a, b, c; cin >> a >> b>> c;

    if(a > c) swap(a,c);
    // a <= c
    ll ans = 0;
    if(a == c) {
        if(a < b) {
            if(a >= 2) ans = 1;
            else ans = -1;
        }
        else if(a == b){
            if(a >= 3) ans = 3;
            else ans = -1;
        } else { // a > b
            if(a-1==b) {
                if(b>=2) ans = 2;
                else ans = -1;
            } else {
                ans = 1;
            }
        }
    } else { // a < c
        if(b > c) ans = 0;
        else if(b < a) ans = 0;
        else {
            ll cur = INF;
            if(a >= 2) chmin(cur, b-a+1);
            if(b-a>=2) chmin(cur, c-b+1);
            ans = cur==INF? -1: cur;
        }
    }
    cout << ans << endl;
}

int main(){
    cin.tie(0); ios::sync_with_stdio(false); //cout << fixed << setprecision(15);
    int T; cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}