#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int t;
	cin>>t;
	const ll INF=1e9+7;
	for(int z=0; z<t; z++){
		ll a, b, c;
		cin>>a>>b>>c;
		if(a>c) swap(a, c);
		ll p=INF, q=INF;
		if(a<b){
			if(b<=c){
				if(a!=b-1) p=c-b+1;
				else if(a>=2) p=c-b+2;
			}else{
				if(a!=c) p=0;
				else if(a>=2) p=1;
			}
		}else if(a==b){
			if(a>=3) p=c-a+3;
		}
		if(a<b){
			if(a>=2) q=b-a+1;
		}else if(a>b){
			if(a!=c) q=0;
			else{
				if(a-b>=2) q=1;
				else if(b>=2) q=2;
			}
		}else{
			if(b!=c){
				if(a>=2) q=1;
			}else{
				if(b>=3) q=3;
			}
		}
		ll ans=min(p, q);
		if(ans==INF) cout<<-1<<endl;
		else cout<<ans<<endl;
		
	}
	return 0;
}