//UVA 11427

 #include<cmath>

 #include<cstdio>

 #include<cstring>

 #define rep(i,n) for(int i=0;i<n;++i)

 #define F(i,j,n) for(int i=j;i<=n;++i)

 double d[][],p;

 int main(){

     int t,n,a,b;

     scanf("%d",&t);

     F(cs,,t){

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

         p=(double)a/b;

         memset(d,,sizeof d);

         d[][]=1.0; d[][]=0.0;

         F(i,,n)

             for(int j=;j*b<=a*i;j++){

                 d[i][j]=d[i-][j]*(-p);

                 if (j) d[i][j]+=d[i-][j-]*p;

             }

         double Q=0.0;

         for(int j=;j*b<=a*n;j++) Q+=d[n][j];

         printf("Case #%d: %d\n",cs,(int)(/Q));

     }

     return ;

 }