[gcjkickstart2018roundb] b. sherlock and the bit strings

using namespace std;

using LL = long long;
const int maxn = 110;
int n, k;
LL p;
int a[maxn], b[maxn], c[maxn];
vector<int> pos;
string ret;

signed () {
  freopen("in", "r", stdin);
  freopen("out", "w", stdout);
  int T, _ = 1;
  scanf("%d", &T);
  while(T--) {
    scanf("%d%d%lld" ,&n,&k,&p);
    p--;
    pos.clear();
    ret.resize(n); fill(ret.begin(), ret.end(), '#');
    for(int i = 0; i < k; i++) {
      scanf("%d%d%d",&a[i],&b[i],&c[i]);
      if(c[i]) ret[a[i]-1] = '1';
      else ret[a[i]-1] = '0';
    }
    while(p) {
      pos.emplace_back(p&1);
      p >>= 1;
    }
    int j = n - 1;
    for(int i = 0; i < pos.size(); i++) {
      if(pos[i] == 1) {
        while(ret[j] == '1' || ret[j] == '0') j--;
        ret[j--] = '1';
      }
      else if(pos[i] == 0) {
        while(ret[j] == '1' || ret[j] == '0') j--;
        ret[j--] = '0';
      }
    }
    for(int i = 0; i < ret.length(); i++) {
      if(ret[i] == '#') ret[i] = '0';
    }
    cout << "Case #" << _++ << ": " << ret << endl;
  }
  return 0;
}