#include <iostream>
#include <string>
#include <vector>
#include <climits>

using namespace std;

using ll = long long;

template <class T>
using grid = vector<vector<T>>;

#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a-1;i>=(ll)(b);i--)

#define input(...) __VA_ARGS__; in(__VA_ARGS__)

void print() {
  std::cout << std::endl;
}

template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail) {
  std::cout << head << " ";
  print(std::forward<Tail>(tail)...);
}

void in() { }

template <class Head, class... Tail>
void in(Head&& head, Tail&&... tail) {
  cin >> head;
  in(std::forward<Tail>(tail)...);
}

ll cost(ll minv, ll maxv1, ll maxv2) {
  ll maxv2_cost = max((maxv2 - maxv1) + 1, 0ll);
  maxv2 -= maxv2_cost;
  ll minv_cost = max((minv - maxv2) + 1, 0ll);
  minv -= minv_cost;
  if (maxv2 <= 0 || minv <= 0) {
    return LLONG_MAX;
  }
  return maxv2_cost + minv_cost;
}

int main() {
  int input(n);
  REP(i, n) {
    ll input(a, b, c);
    // bが一番大きい時
    ll pattern1 = min(cost(a, b, c), cost(c, b, a));

    // bが一番小さい時
    ll pattern2 = min(cost(b, c, a), cost(b, a, c));

    ll mincost = min(pattern1, pattern2);
    if (mincost == LLONG_MAX) {
      print(-1);
    } else {
      print(mincost);
    }
  }
}