#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod=2;
int t,a,b,c;
int fac[3],inv[3];
int qp(int a,int b){
	int ans=1;
	while(b){
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
void init(){
	fac[0]=1,fac[1]=1;
	inv[0]=1,inv[1]=1;
}
int calc(int n,int k){
	if(n<k) return 0;
	return 1;
}
int C(int n,int k){
	int ans=1;
	while(n||k){
		ans=(ans*calc(n%2,k%2))%2;
		n/=2,k/=2;
	}
    return ans;
}
signed main(){

	init();
	cin>>t;
	while(t--){
		cin>>a>>b>>c;
		if(c%2==0){
			cout<<0<<'\n';
			continue;
		}
		int cnt=c*C(b+c-1,b)%2ll;
		int ans=c*C(cnt+a-1,a)%2ll;
		cout<<ans<<'\n';
	}
	return 0;
} 
/*
cnt=c*C(b+c-1,b)
ans=c*C(cnt+a-1,a)
*/