HDU5512(水题～)

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

int gcd (int a, int b) {
    return b == 0 ? a : gcd (b, a%b);
}
int n, a, b;

int main () {
    //freopen ("in", "r", stdin);
    int t, kase = 0;
    cin >> t;
    while (t--) {
        cin >> n >> a >> b;
        int gg = gcd (a, b), ans = 0;
        for (int i = 1; i <= n; i++) {
            if (i%gg == 0)
                ans++;
        }
        cout << "Case #" << ++kase << ": ";
        cout << (!(ans&1)? "Iaka" : "Yuwgna") << endl;
    }
    return 0;
}