#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define fi first
#define se second
using namespace std;
typedef long long int ll;

// mod
const int K = 20;
const int mod = 1<<K;
struct mint {
  ll x;
  mint():x(0){}
  mint(ll x):x((x%mod+mod)%mod){}
  mint& operator+=(const mint& a){ if((x+=a.x)>=mod) x-=mod; return *this;}
  mint& operator-=(const mint& a){ if((x+=mod-a.x)>=mod) x-=mod; return *this;}
  mint& operator*=(const mint& a){ (x*=a.x)%=mod; return *this;}
  mint operator+(const mint& a)const{ return mint(*this) += a;}
  mint operator-(const mint& a)const{ return mint(*this) -= a;}
  mint operator*(const mint& a)const{ return mint(*this) *= a;}
};
mint ex(mint a, ll t) {
  if(!t) return 1;
  mint res = ex(a,t/2);
  res *= res;
  return (t&1)?res*a:res;
}
//

typedef pair<mint,int> P;
P p[mod*2];
mint ip[mod*2];

mint inv(mint a) { return ex(a,mod/2-1);}
mint comb(int a, int b) {
  int c = a-b;
  int two = p[a].se-p[b].se-p[c].se;
  if (two >= K) return 0;
  mint res = p[a].fi*ip[b]*ip[c];
  res *= 1<<two;
  return res;
}

int main() {
  int ts;
  scanf("%d",&ts);
  assert(1 <= ts && ts <= 100000);
  p[0] = P(1,0);
  for (int i = 1; i < mod*2; ++i) {
    p[i] = p[i-1];
    int x = i;
    while (x%2 == 0) p[i].se++, x >>= 1;
    p[i].fi *= x;
  }
  ip[mod*2-1] = inv(p[mod*2-1].fi);
  for (int i = mod*2-1; i >= 1; --i) {
    ip[i-1] = ip[i];
    int x = i;
    while (x%2 == 0) x >>= 1;
    ip[i-1] *= x;
  }
  while (ts--) {
    int a,b,c;
    scanf("%d%d%d",&a,&b,&c);
    assert(1 <= a && a <= 1000000);
    assert(1 <= b && b <= 1000000);
    assert(1 <= c && c <= 1000000);
    // C(C(c+b-1,b)*c+a-1,a)*c
    mint x = comb(c+b-1,b)*c;
    x = x+a-1;
    int ans = ((x.x&a)==a)&c;
    printf("%d\n", ans);
  }
  return 0;
}