#include <iostream>
#include<vector>


using namespace std;

int main()
{
    int t;
	cin>>t;
	while(t--)
	{
		long long n,m,k;
		cin>>n>>m>>k;
		long long count=0;
		long long maxio=0;
		vector<long long>b;
		if(n%2!=0) b.push_back(n);
		else count+=n;
		if(m%2!=0) b.push_back(m);
		else count+=m;
		if(k%2!=0) b.push_back(k);
		else count+=k;
		int nq=(int)b.size();
		for(int i=0;i<nq;i++)
		{
			maxio=max(maxio,b[i]);
		}
		count+=maxio;
		cout<<count<<endl;
	}
	return 0;
}