#include <bits/stdc++.h>
#define LLI long long int
#define FOR(v, a, b) for(LLI v = (a); v < (b); ++v)
#define FORE(v, a, b) for(LLI v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(LLI v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define popcount __builtin_popcount
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <misc/C++/Debug.cpp>
#else
#define dump(...) ((void)0)
#endif

#define gcd __gcd

using namespace std;
template <class T> constexpr T lcm(T m, T n){return m/gcd(m,n)*n;}

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}

struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;

bool is_kadomatsu(LLI a, LLI b, LLI c){
  if(a <= 0 or b <= 0 or c <= 0) return false;
  if(a == b or b == c or c == a) return false;
  if(a < b and b < c) return false;
  if(a > b and b > c) return false;
  
  return true;
}

LLI solve(LLI a, LLI b, LLI c){
  if(is_kadomatsu(a,b,c)) return 0;
  
  if(a <= 5 and b <= 5 and c <= 5){
    LLI ret = LLONG_MAX;

    FORE(i,1,a){
      FORE(j,1,b){
        FORE(k,1,c){
          if(is_kadomatsu(i,j,k)){
            chmin(ret, abs(i-a) + abs(j-b) + abs(k-c));
          }
        }
      }
    }

    if(ret == LLONG_MAX) return -1;
    return ret;
  }

  LLI ret = LLONG_MAX;

  if(a == b or b == c or c == a){
    FORE(i,0,5){
      FORE(j,0,5){
        FORE(k,0,5){
          if(is_kadomatsu(a-i, b-j, c-k)){
            chmin(ret, i + j + k);
          }
        }
      }
    }
  }

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

  
  if(a < b and b < c){
    if(is_kadomatsu(a, b, a+1)) chmin(ret, abs(c - (a+1)));
    if(is_kadomatsu(a, b, a-1)) chmin(ret, abs(c - (a-1)));
    if(is_kadomatsu(a, b, b-1)) chmin(ret, abs(c - (b-1)));

    if(is_kadomatsu(a, a-1, c)) chmin(ret, abs(b - (a-1)));
  }
  
    

  if(ret == LLONG_MAX) return -1;
  return ret;
}


int main(){
  int T;
  while(cin >> T){
    REP(i,T){
      LLI a,b,c; cin >> a >> b >> c;

      cout << solve(a,b,c) << endl;
    }
  }

  return 0;
}