#include <iostream>
#define ll long long 
using namespace std;

int main()
{
  int t;
  cin >> t;
  while (t--) {
    int n, m, k;
    cin >> n >> m >> k;
    int maxio = 0;
    ll count = 0;
    if (n % 2 != 0)
      maxio = max(maxio, n);
    else
      count += 1LL * n;
    if (m % 2 != 0)
      maxio = max(maxio, m);
    else
      count += 1LL * m;
    if (k % 2 != 0)
      maxio = max(maxio, k);
    else
      count += 1LL * k;
    count += 1LL*maxio;
    cout << count << endl;
  }
	return 0;
}