#include <bits/stdc++.h>
using namespace std;

int modpow(int a, int b, int mod) {
	int ret = 1;
	while (b > 0) {
		if (b & 1) {
			ret = 1LL * ret * a % mod;
		}
		a = 1LL * a * a % mod;
		b >>= 1;
	}
	return ret;
}

int main() {
	int T;
	cin >> T;
	while (T--) {
		int A, B, C;
		cin >> A >> B >> C;

		if (C % 2 == 0) {
			puts("0");
			continue;
		}

		const int mod = 1 << 24;
		int X = (modpow(C, B + 1, mod) - 1) % mod;
		puts((X & A) != 0 ? "0" : "1");
	}
}