#include <algorithm>
#include <cfloat>
#include <climits>
#include <cmath>
#include <complex>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <iostream>
#include <map>
#include <memory>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <vector>

using namespace std;

typedef long long ll;

#define sz size()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define all(c) (c).begin(), (c).end()
#define rep(i,a,b) for(ll i=(a);i<(b);++i)
#define per(i,a,b) for(ll i=b-1LL;i>=(a);--i)
#define clr(a, b) memset((a), (b) ,sizeof(a))
#define ctos(c) string(1,c)
#define endl "\n"
#define print(x) cout<<#x<<" = "<<x<<endl;

#define MOD 1000000007

int f1(int a, int b, int c){
  if(a<1||a>1000000000)return -2;
  if(b<1||b>1000000000)return -2;
  if(c<1||c>1000000000)return -2;
  int e = 0;
  if(a==c){
    a--;
    e++;
  }
  ll mx = max(a,c);
  ll mn = min(a,c);
  if(b<=mx){
    ll d1 = max(0LL,mx-(b-1));
    ll d2 = max(0LL,mn-(b-2));
    mx -= d1;
    mn -= d2;
    e += d1+d2;
  }
  if(mx>0&&mn>0){
    return e;
  }
  else{
    return 2000000010;
  }
}

int f2(int a, int b, int c){
  if(a<1||a>1000000000)return -2;
  if(b<1||b>1000000000)return -2;
  if(c<1||c>1000000000)return -2;
  int e = 0;
  if(a==c){
    a--;
    e++;
  }
  ll mx = max(a,c);
  ll mn = min(a,c);
  if(b<=mx){
    ll d = max(0LL,b-(mn-1));
    b -= d;
    e += d;
  }
  if(a>0&&b>0&&c>0){
    return e;
  }
  else{
    return 2000000010;
  }
}

int main(){
  int T;
  cin>>T;
  for(int t = 0; t < T; t++){
    int a,b,c;
    cin>>a>>b>>c;
    ll res = min(f1(a,b,c),f2(a,b,c));
    if(res==2000000010){
      cout << -1 << endl;
    }
    else{
      cout << res << endl;
    }
  }
  return 0;
}