// Xep hang mua ve
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define LG 20
const int INF = 1e18 * 9 + 7;
const int N = 2001;
int a, b, c, t;
signed main()
{
//freopen("sinh.out","r", stdin);
//freopen("present.out","w", stdout);
//ios::sync_with_stdio(0); cin.tie(0);
cin >> t;
while(t--){
cin >> a >> b >> c;
if(a == b) cout << c;
else if(a == c) cout << b;
else cout << a;
cout << '\n';
}
return 0;
}
/*
7 6
4 3 2 1 5 1 4
1 2
2 3
2 4
3 7
1 5
5 6
5
4 7
7 3
3 7
6 1
4 6
5 5
4 1 10 7 5
1 2
2 3
3 5
4 3
5 2
5
5 4
3 4
1 3
1 4
3 3
*/
Going to office | Color the boxes |
Missing numbers | Maximum sum |
13 Reasons Why | Friend's Relationship |
Health of a person | Divisibility |
A. Movement | Numbers in a matrix |
Sequences | Split houses |
Divisible | Three primes |
Coprimes | Cost of balloons |
One String No Trouble | Help Jarvis! |
Lift queries | Goki and his breakup |
Ali and Helping innocent people | Book of Potion making |
Duration | Birthday Party |
e-maze-in | Bricks Game |
Char Sum | Two Strings |
Anagrams | Prime Number |