#include <bits/stdc++.h>
using namespace std;

#define INF_LL (int64)1e18
#define INF (int32)1e9
#define REP(i, n) for(int64 i = 0;i < (n);i++)
#define FOR(i, a, b) for(int64 i = (a);i < (b);i++)
#define all(x) x.begin(),x.end()
#define fs first
#define sc second

using int32 = int_fast32_t;
using uint32 = uint_fast32_t;
using int64 = int_fast64_t;
using uint64 = uint_fast64_t;
using PII = pair<int32, int32>;
using PLL = pair<int64, int64>;

const double eps = 1e-10;

template<typename A, typename B>inline void chmin(A &a, B b){if(a > b) a = b;}
template<typename A, typename B>inline void chmax(A &a, B b){if(a < b) a = b;}

template<typename T>
vector<T> make_v(size_t a){return vector<T>(a);}

template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts){
	return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value!=0>::type
fill_v(U &u,const V... v){u=U(v...);}

template<typename T,typename U,typename... V>
typename enable_if<is_same<T, U>::value==0>::type
fill_v(U &u,const V... v){
	for(auto &e:u) fill_v<T>(e,v...);
}

void solve() {
  int64 A, B, C;
  cin >> A >> B >> C;
  vector<int64> ord(3);
  iota(all(ord), 0);
  int64 res = INF;
  do {
    if (ord[0] != 1 && ord[2] != 1) continue;
    vector<int64> a({A, B, C});
    int64 sum = 0;
//    cout << ord[0] << " " << ord[1] << " " << ord[2] << endl;
    REP(i, 3) {
      REP(j, 3) {
        if (ord[j] == i) {
          int64 mn = INF;
          REP(k, 3) {
            if (ord[k] < ord[j]) {
              mn = min(mn, a[k]);
            }
          }
          sum += max((int64)0, a[j]-mn+1);
          a[j] = min(a[j], mn-1);
          if (a[j] <= 0) sum = INF;
        }
      }
      if (sum == INF) break;
    }
//    cout << sum << endl;
//    cout << endl;
    chmin(res, sum);
  } while (next_permutation(all(ord)));
  if (res == INF) cout << -1 << endl;
  else cout << res << endl;
}

int main(void) {
  cin.tie(0);
  ios::sync_with_stdio(false);
  int64 T;
  cin >> T;
  REP(_, T){
    solve();
  }
}