#include<stdio.h>

const long long mod=1048576;
const long gpow=524287;
long long kai[2000000];
int pow[2000000];

int count(long i){
	if(i%2==0){
		return 1+count(i/2);
	}
	return 0;
}

long long gyaku(long long e,long p){
	if(p==0) return 1;
	if(p%2==1) return gyaku(e*e%mod,p/2)*e%mod;
	else return gyaku(e*e%mod,p/2);
}

int main(){
	int e;
	long t,i=0;
	long b,c;
	long long a,d;
	kai[0]=1;
	scanf("%ld",&t);
	for(;t>0;t--){
		scanf("%lld %ld %ld",&a,&b,&c);
		if(c%2==0){
			printf("0\n");
		}else{
			for(;i<b+c-1;i++){
				if(i%2==0){
					kai[i+1]=kai[i]*(i+1)%mod;
					pow[i+1]=pow[i];
				}else{
					kai[i+1]=kai[i];
					pow[i+1]=(pow[i]+count(i+1))%20;
				}
			}
			d=kai[b+c-1]*gyaku(kai[b],gpow)%mod*gyaku(kai[c-1],gpow)%mod;
			d=d*c%mod;
			e=(pow[b+c-1]-pow[b]-pow[c-1]+40)%20;
			d<<=e;
			d=d+a-1;
			printf("%d\n",(d&a)!=a);
		}
	}
	return 0;
}