#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,1,0,-1,1,-1,1,-1};
template <typename T> inline bool chmax(T &a, T b) {
  return ((a < b) ? (a = b, true) : (false));
}
template <typename T> inline bool chmin(T &a, T b) {
  return ((a > b) ? (a = b, true) : (false));
}
ll modpow(ll a,ll n, ll mod) {
  a%=mod;if(a==0)return 0;
  ll res = 1;
  while (n > 0) {
      if (n & 1) res = res * a % mod;
      a = a * a % mod;
      n >>= 1;
  }
  return res;
}

int main(){
  ll m=1LL<<20;
  vl fact(m*2),ex(m*2);
  fact[0]=1;
  for(ll i=1;i<m*2;i++){
    ll p=i;
    ex[i]+=ex[i-1];
    while(p%2==0){
      p/=2;ex[i]++;
    }
    fact[i]=fact[i-1]*p%m;
  }
  ll t;cin >> t;
  while(t--){
    ll a,b,c;cin >> a >> b >> c;
    auto f=fact[c+b-1]*modpow(fact[b],m/2-1,m)%m*modpow(fact[c-1],m/2-1,m)%m;
    ll e=ex[c+b-1]-ex[b]-ex[c-1];f=f*modpow(2,e,m)%m;
    //cout << f << " " << e << endl;
    f=f*c+a-1;f%=m;
     //cout << f << endl;
    ll ans=1;
    rep(i,20){
      if((f>>i&1)==0&&(a>>i&1))ans=0;
    }
    cout << ((ans*c)&1) << endl;
  }
}