#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define ll long long
#define ld long double
#define INF 1000000000000000000
typedef pair<ll, ll> pll;

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

    int T;
    cin >> T;
    rep(i, T) {
        ll A, B, C;
        cin >> A >> B >> C;
        ll ans = INF;
        if (B == 0) {
            cout << -1 << endl;
        } else if ((B > A && B > C) || (B < A && B < C)) {
            if (A != C) {
                cout << 0 << endl;
            } else if (A == 1) {
                cout << -1 << endl;
            } else {
                cout << 1 << endl;
            }
        } else {
            ll tmp = 0;
            bool j = 0;
            if (A == C)
                A--, j = 1, tmp = 1;
            // B最小化
            ll mi = min(A, C) - 1;
            if (mi > 0)
                tmp += B - mi, ans = min(ans, tmp);
            // B最大化
            tmp = 0;
            if (j)
                tmp = 1;
            ll a, c;
            if (A > C)
                a = B - 2, c = A - 1;
            else
                a = B - 1, c = A - 2;
            if (a > 0 && c > 0)
                tmp += (A - a) + (C - c), ans = min(ans, tmp);
            cout << (ans == INF ? -1 : ans) << endl;
        }
    }
}