1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<queue>
 5 #include<stack>
 6 #include<map>
 7 #define mod 10000
 8 #define ll __int64
 9 using namespace std;
10 struct matrix
11 {
12    ll m[5][5];
13 } ans,exm;
14 ll x,m,k,c;
15 struct matrix matrix_mulit(struct matrix aa,struct matrix bb)
16 {
17     struct matrix there;
18     for(int i=0;i<2;i++)
19     {
20         for(int j=0;j<2;j++)
21         {
22             there.m[i][j]=0;
23             for(int u=0;u<2;u++)
24             there.m[i][j]=(there.m[i][j]+aa.m[i][u]*bb.m[u][j]%k)%k;
25         }
26     }
27     return there;
28 }
29 ll matrix_quick(ll xx,ll gg)
30 {
31      exm.m[0][0]=10;
32      exm.m[0][1]=0;
33      exm.m[1][0]=1;
34      exm.m[1][1]=1;
35      ans.m[0][0]=xx;
36      ans.m[1][1]=0;  
37      ans.m[0][1]=xx;
38      ans.m[1][0]=0;
39      while(gg)
40      {
41          if(gg&1)  
42         ans=matrix_mulit(ans,exm);        
43         exm = matrix_mulit(exm, exm);
44         gg >>= 1;
45     }
46      return ans.m[0][0];
47 } 
48 ll n; 
49 int main()
50 {
51         while(scanf("%I64d",&n)!=EOF)
52        {
53         for(ll i=1;i<=n;i++)
54         {
55             scanf("%I64d %I64d %I64d %I64d",&x,&m,&k,&c);
56             printf("Case #%d:\n",i);
57             ll ggg=matrix_quick(x,m-1);
58             if(ggg==c)
59             printf("Yes\n");
60             else  
61             printf("No\n");  
62         }
63     }
64     return 0;
65 }