#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 1ll<<20;

// {
//   long long pb = cmb(b+c-1, b);
//   eprintln("Pb = " , pb%2);
//   vector<vector<long long>> dp(a+1, vector<long long>(c+1, 0));
//   dp[0][0] = 1;
//   for(int i=0; i<a; i++){
//     for(int j=0; j<c; j++){
//       if(dp[i][j] == 0)continue;
//       for(int k=1; k+i<=a; k++){
//         for(int l=j+1; l<=c; l++){
//           (dp[i+k][l] += dp[i][j] * cmb_mod2(pb+k-1, k) ) &= 1;
//         }
//       }
//     }
//   }
//   println( (accumulate(dp[a].begin(), dp[a].end(), 0ll) * c) % 2);
// }

int cmb_mod2(long long n, long long r){
  long long two = 0;
  for(long long i=2; i<=n; i*=2) two += n/i;
  for(long long i=2; i<=r; i*=2) two -= r/i;
  for(long long i=2; i<=n-r; i*=2) two -= (n-r)/i;
  return two==0;
}

long long totient(long long n){
  long long ret = n;
  for(long long p=2; p*p <= n; p++){
    if(n%p != 0) continue;
    while(n%p == 0){
      n /= p;
    }
    ret = ret - ret / p;
  }
  if(n != 1){
    ret = ret - ret / n;
  }
  return ret;
}

int main(){
  for(int i=0; i<20; i++){
    for(int j=0; j<=i; j++){
      eprint( "01"s[(i&j)==j], "");
    }
    eprintln("");
  }
  int t;
  cin >> t;

  auto tot = totient(mod);

  vector<long long> o(2000001, 1);
  vector<long long> ro(2000001, 1);
  vector<long long> e(2000001, 0);
  for(int i=2; i<2000001; i++){
    long long v = i;
    while(v%2==0){
      e[i]++;
      v>>=1;
    }
    o[i] = v%mod;
    ro[i] = my_pow_mod(v, tot-1, mod);
  }
  for(int i=2; i<2000001; i++){
    (o[i] *= o[i-1]) %= mod;
    (ro[i] *= ro[i-1]) %= mod;
    e[i] += e[i-1];
  }

  auto ncr = [&](long long n, long long r){
    long long odd = o[n] * ro[r] % mod * ro[n-r] % mod;
    // long long odd = o[n] * my_pow_mod(o[r]*o[n-1]%mod, tot-1, mod) % mod;
    long long two = e[n] - e[r] - e[n-r];
    return odd * my_pow_mod(2, two, mod) % mod;
  };

  while(t--){
    int a,b,c;
    cin >> a,b,c;

    long long Pab = (ncr(b+c-1, b) * c) % mod;
    long long x = (Pab + a - 1 + mod) * c % mod;

    cout << (((x&a)==a) * c)%2 << endl;
  }

  return 0;
}