#include #define rep(i,n) for(int i=(0);i<(n);i++) using namespace std; typedef long long ll; ll solve(ll a, ll b, ll c){ ll INF = 1e12; ll ret = INF; // 132 if(a >= 1 && b >= 3 && c >= 2){ ll x = min(c, b - 1); ll t = c - x; x = min(a, x - 1); t += a - x; ret = min(ret, t); } // 213 if(a >= 2 && b >= 1 && c >= 3){ ll x = min(a, c - 1); ll t = a - x; x = min(b, x - 1); t += b - x; ret = min(ret, t); } // 231 if(a >= 2 && b >= 3 && c >= 1){ ll x = min(a, b - 1); ll t = a - x; x = min(c, x - 1); t += c - x; ret = min(ret, t); } // 312 if(a >= 3 && b >= 1 && c >= 2){ ll x = min(c, a - 1); ll t = c - x; x = min(b, x - 1); t += b - x; ret = min(ret, t); } if(ret == INF) return -1; return ret; } int main(){ cin.tie(0); ios::sync_with_stdio(false); int t; cin >> t; vector a(t), b(t), c(t); rep(i, t) cin >> a[i] >> b[i] >> c[i]; rep(i, t) cout << solve(a[i], b[i], c[i]) << "\n"; }