#include <cstdio>

typedef long long ll;

const int YO = 2125212;
ll fact[YO];
ll bow[YO];

const int MO = 1<<21;
const int MASK = MO-1;

void extgcd(ll a,ll b,ll &x,ll &y){
  x=1;
  y=0;
  if(b!=0){
    extgcd(b,a%b,y,x);
    y -= (a/b) * x;
  }
}
ll modinv(ll v){
  ll x,y;
  extgcd(v,MO,x,y);
  return (x+MO)&MASK;
}

int main(){
  fact[0] = 1; bow[0] = 0;
  for(int i=1;i<YO;i++){
    int v = i;
    bow[i] = bow[i-1];
    while(v%2==0){
      bow[i]++; v/=2;
    }
    fact[i] = (fact[i-1]*v) & MASK;
  }
  int t; scanf("%d",&t);
  while(t--){
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    if(c%2==0){
      puts("0");
    }else{
      ll x = (((((fact[c+b-1] *modinv(fact[b]))&MASK) *modinv(fact[c-1]))&MASK) *c)&MASK;
      ll bin = bow[c+b-1] - bow[b] - bow[c-1];
      while(x!=0 && bin--){
        x = (x<<1)&MASK;
      }
      x = (x+a-1+MO)&MASK;
      int check = (~x)&a;
      puts(check!=0 ? "0" : "1");
    }
  }
  return 0;
}