#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
const int INF = numeric_limits<int>::max();

int solve() {
  int a, b, c;
  int at, bt, ct;

  cin >> a >> b >> c;

  int ret = INF;

  // b is max
  int x = 0;
  at = a, bt = b, ct = c;
  if (at >= bt) {
    x += at - bt + 1;
    at = bt - 1;
  }
  if (ct >= bt) {
    x += ct - bt + 1;
    ct = bt - 1;
  }
  if (at == ct) {
    ++x;
    --at;
  }
  if (at > 0 && bt > 0 && ct > 0)
    ret = min(ret, x);
  
  // b is min
  int y = 0;
  at = a, bt = b, ct = c;
  if (at == ct) {
    --at;
    ++y;
  }
  if (bt >= at) {
    y += bt - at + 1;
    bt = at - 1;
  }
  if (bt >= ct) {
    y += bt - ct + 1;
    bt = ct - 1;
  }
  if (at > 0 && bt > 0 && ct > 0)
    ret = min(ret, y);

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

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int t;
  cin >> t;
  while (t--) {
    cout << solve() << endl;
  }
  return 0;
}