#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <vector>
#include <string>
#include <iostream>
#include <list>
#include <cstdlib>
#include <bitset>
#define lowbit(x) (x&(-x))
#define lson root<<1,l,mid
#define rson root<<1,mid+1,r
const long long INF = 0x3f3f3f3f3f3f3f3fLL;
const int inf = 0x3f3f3f3f;
using namespace std;
int ans[1100];
char ss[][8] = { "oh!","yeah!" };
int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int s, n, m;
		int cnt = 0;
		scanf("%d%d%d", &s, &n, &m);
		for (; n != m && s; --s)
		{
			if (m < n || m & 1)
			{
				++m;
				ans[cnt++] = 1;
			}
			else
			{
				m >>= 1;
				ans[cnt++] = 0;
			}
		}
		if (!s && n != m)
			puts("OMG!");
		else
		{
			for (int i = cnt - 1; i >= 0; --i)
				printf("%s%c", ss[ans[i]], " \n"[i == 0]);
		}
	}
//	system("pause");
}