#include using namespace std; #define F first #define S second #define R cin>> #define Z class #define ll long long #define ln cout<<'\n' #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.10f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) templatevoid pr(A a){cout<void pr(A a,B b){cout<void pr(A a,B b,C c){cout<void pr(A a,B b,C c,D d){cout<void PR(A a,ll n){rep(i,n){if(i)cout<<' ';cout<=0&&x=0&&y P; ll ck(vector a) { int x=a[1]; sort(all(a)); return a[1]!=x&&a[0]!=a[1]&&a[1]!=a[2]&&a[0]>0; } void Main() { ll T; cin >> T; while(T--) { vector a(3); rep(i,3) cin >> a[i]; if(ck(a)) { pr(0); continue; } vector e; rep(i,3)rep(j,3) e.pb(i); ll ans=MAXL; do { ll sum=0; vector b=a; rep(i,3) { ll x=-MAXL; rep(j,3) { if(j!=e[i]) x=max(x,b[j]); } x=min(x,b[e[i]]-1); sum+=abs(b[e[i]]-x); b[e[i]]=x; if(ck(b)) ans=min(ans,sum); } } while(next_permutation(all(e))); if(ans==MAXL) ans=-1; pr(ans); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}