1 #include <iostream>
 2 #include <string>
 3 #include <cstdio>
 4 #include <cstring>
 5 #include <algorithm>
 6 #include <climits>
 7 #include <cmath>
 8 #include <vector>
 9 #include <queue>
10 #include <stack>
11 #include <set>
12 #include <map>
13 using namespace std;
14 typedef long long           LL ;
15 typedef unsigned long long ULL ;
16 const int    maxn = 1e5 + 10   ;
17 const int    inf  = 0x3f3f3f3f ;
18 const int    npos = -1         ;
19 const int    mod  = 1e9 + 7    ;
20 const int    mxx  = 100 + 5    ;
21 const double eps  = 1e-6       ;
22 const double PI   = acos(-1.0) ;
23 
24 int gcd(int x, int y){
25     return y?gcd(y,x%y):x;
26 }
27 int T, n, a, b, c, d, Yuwgna;
28 int main(){
29     // freopen("in.txt","r",stdin);
30     // freopen("out.txt","w",stdout);
31     while(~scanf("%d",&T)){
32         for(int kase=1;kase<=T;kase++){
33             scanf("%d %d %d",&n,&a,&b);
34             d=gcd(a,b);
35             c=(n/d)-2;
36             Yuwgna=c&1;
37             printf("Case #%d: %s\n",kase,Yuwgna?"Yuwgna":"Iaka");
38         }
39     }
40     return 0;
41 }