#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<vector>
#include<cstring>
#include<set>
#define ll long long
using namespace std;
const int N = 10100;
const int inf = 0x3f3f3f3f;
#define PI 3.141592653589
#define fr(i,r,l) for(int i=r;i<l;i++)


int ans[N];

int main() {
    int t;
    scanf("%d", &t);
    while (t--) {
		int s, n, m;
		memset(ans, 0, sizeof(ans));
        scanf("%d %d %d", &s, &n, &m);
        int pos = 0;
        while (m != n) {
            if (m > n) {
                if (m & 1) {
                    ++m;
                    ans[++pos] = 1;
                } else {
                    m >>= 1;
                    ans[++pos] = 2;
                }
            } else {
                ++m;
                ans[++pos] = 1;
            }
        }
        if (pos <= s) {
            for (int i = pos; i >= 1; --i) {
                if (ans[i] == 1) {
                    printf("yeah!%c", " \n"[i == 1]);
                } else {
                    printf("oh!%c", " \n"[i == 1]);
                }
            }
        } else {
            puts("OMG!");
        }
    }
    return 0;
}