#include<cstdio>

#include<cstring>

#include<cmath>

#include<queue>

#include<algorithm>

using namespace std;

int n,a,b;

int gcd(int a,int b)

{

    int t;

    while(b) t = a%b,a = b,b = t;

    return a;

}

int main()

{

    int T;

    scanf("%d",&T);

    for(int Case=; Case<=T; Case++)

    {

        scanf("%d%d%d",&n,&a,&b);

        printf("Case #%d: ",Case);

        if((n/gcd(a,b)-)%==) printf("Iaka\n");

        else printf("Yuwgna\n");

    }

    return ;

}