#include<bits/stdc++.h>
using namespace std;
#define ALL(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define INF 1000000000
#define mod 1000000007
using ll=long long;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0};
int dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

// Bが最大値or最小値で，3値が全て異なれば角松
bool isKad(ll a,ll b,ll c){
    if(a==b or b==c or c==a) return false;
    return max({a,b,c})==b or min({a,b,c})==b;
}

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

    if(isKad(a,b,c)){
        cout<<0<<endl;
        return ;
    }

    if(a>c) swap(a,c);

    if(a==b and b==c and c==a){
        ll ans=0;
        a--,ans++;
        c-=2,ans+=2;
        if(a>0 and c>0){
            cout<<ans<<endl;
        }else{
            cout<<-1<<endl;
        }
    }
    else if(a<=b and b<=c){
        ll ans=LINF;
        if(a-1>0) chmin(ans,b-(a-1));
        
        ll cost=0;
        cost+=c-(b-1);c=b-1;
        if(a==c) c--,cost++;
        if(c>0) chmin(ans,cost);

        if(ans==LINF) cout<<-1<<endl;
        else cout<<ans<<endl;
    }
    else if(a==c and b>a){
        a--;
        if(a>0) cout<<1<<endl;
        else cout<<-1<<endl;
    }
    else if(a==c and b<a){
        ll cost=0;
        a--,cost++;
        if(a==b) b--,cost++;
        if(a>0 and b>0) cout<<cost<<endl;
        else cout<<-1<<endl;
    }
    else{
        assert(false);
    }
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(0);
    
    int q;cin>>q;
    while(q--) solve();
    return 0;
}