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

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

ll calc(ll fi, ll se, ll th) {
  ll res = 0;
  if (se >= fi) {
    res += se-fi+1;
    se = fi-1;
  }
  if (se <= 1) return -1;
  if (th >= se) {
    res += th-se+1;
  }
  return res;
}


const ll INF = 1e18; 
int main() {
  int t;
  cin >> t;
  rep(ti, t) {
    ll a, b, c;
    cin >> a >> b >> c;
    ll ans = INF;
    bool flag = false;
    ll cand = INF;
    // case1 
    if (calc(b,a,c) != -1) {
      flag = true;
      cand = min(cand, calc(b,a,c));
    };
    // case2
    if (calc(c,a,b) != -1) {
      flag = true;
      cand = min(cand, calc(c,a,b));
    } 
    // case3
    if (calc(a,c,b) != -1) {
      flag = true;
      cand = min(cand, calc(a,c,b));
    }
    // case4
    if (calc(b,c,a) != -1) {
      flag = true;
      cand = min(cand, calc(b,c,a));
    }
    if (flag) ans = cand;
    else ans = -1;
    cout << ans << endl;
  }


}