#include <iostream>
using namespace std;
//2的幂
int fac[15] = { 2,4,8,16,32,64,128,256,512,1024,2048,4096,8192,16384,32768 };
void solve(int n, int m, int p)
{
if (n <= 2 * m) //金币够贿赂,且贿赂完还有剩余
{
if (n != p && (n % 2 == p % 2)) //不是决策者,而且奇偶性和决策者相同
cout << 1 << endl;
else if (n == p) //是决策者
cout << m - (n - 1) / 2 << endl;
else //不是决策者,而且奇偶性和决策者不同
cout << 0 << endl;
return;
}
else if (n == 2 * m + 1) //金币够贿赂,但贿赂完没有剩余
{
if (p < 2 * m && p & 1) //不是决策者
cout << 1 << endl;
else //是决策者
cout << 0 << endl;
return;
}
int t = n - 2 * m;
for (int i = 0; i < 14; i++)
{
if (t == fac[i])
{
cout << 0 << endl;
return;
}
}
for (int i = 1; i < 14; i++)
{
if (t < fac[i])
{
if (p > 2 * m + fac[i - 1] && p < 2 * m + fac[i]) //是决策者
cout << "Thrown" << endl;
else //不是决策者
cout << 0 << endl;
return;
}
}
}
int main()
{
int T;
cin >> T;
while (T--)
{
int n, m, p;
cin >> n >> m >> p;
solve(n, m, p);
}
return 0;
}