1422A - Fence - CodeForces Solution

                //~~~  Shree Ganeshaay Naamh ~~~//

#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double lld;
const double eps = 1e-6;
const ll M=1e9+7;
#define pb emplace_back
#define pbs push_back
#define ff first
#define ss second
#define mpp make_pair
#define srt(x) sort(x.begin(), x.end())
#define srtg(x) sort(x.begin(), x.end(),greater<>())
#define all(v) v.begin(),v.end()
#define pree(x) cout << fixed << setprecision(10) << x
#define l_b lower_bound
#define u_b upper_bound


// Sieve code
/*
const ll N= 1000000;
bool sieve[N+1];

void createsieve(){
    sieve[0] = sieve[1] = true;
    sieve[2]=false;
    for(ll i=2;i*i<N;i++){
          if(sieve[i]==false){
        for(ll j=i*i;j<N;j=j+i){
            sieve[j] = true;
        }
      }
    } 
    
}
*/

bool ispal(string s){
    
 ll n = s.length();

 for(ll i=0;i<n/2;i++){
     if(s[i]!=s[n-i-1]){
         return false;
     }
 }
   return true;
}

ll andOperator(ll n, ll m){

  ll answer = 0;

  for(ll i = 63 ;i>=0; i--){
      if((m&(1ll<<i))!=(n&(1ll<<i))){
         break;
      }else{
         answer |= (n&(1ll<<i));
      }
  }
  return answer;
}

ll power(ll a,ll b,ll p){
    ll res=1;
    if(a==0){
        return 0;
    }
    while(b>0){
        if(b%2!=0){
            res=(res*a)%p;
        }
        b=b/2;
        a=(a*a)%p;
    }
    return res;
}

int main(){
  
    
   ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
 
  ll t;
  cin>>t;
  while(t--){
  
  ll a,b,c;
  cin>>a>>b>>c;
  ll d =max(a,max(b,c));
  if(d==1){
    cout<<1<<"\n";
  }else{
  cout<<d-(ll)1<<"\n";
  }

  }

  return 0;
}