#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
template <typename T> using posteriority_queue = priority_queue<T, vector<T>, greater<T> >;
const int INF = 0x3f3f3f3f;
const ll LINF = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-8;
const int MOD = 1000000007;
// const int MOD = 998244353;
const int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
// const int dy[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
template <typename T> void unique(vector<T> &a) { a.erase(unique(ALL(a)), a.end()); }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  int t; cin >> t;
  while (t--) {
    int a, b, c; cin >> a >> b >> c;
    int ans = INF;
    if (a == c) {
      if (a - 2 >= 1) chmin(ans, max(b - (a - 2), 0) + 1);
    } else {
      if (min(a, c) - 1 >= 1) chmin(ans, max(b - (min(a, c) - 1), 0));
    }
    if (b - 2 >= 1 && a - 1 >= 1) chmin(ans, max(a - (b - 1), 0) + max(c - min(b - 2, a - 1), 0));
    swap(a, c);
    if (b - 2 >= 1 && a - 1 >= 1) chmin(ans, max(a - (b - 1), 0) + max(c - min(b - 2, a - 1), 0));
    cout << (ans == INF ? -1 : ans) << '\n';
  }
  return 0;
}