#include <cstdio>

 #include <algorithm>

 #include <cstring>

 #include <ctype.h>

 #include <cstdlib>

 #include <stack>

 #include <set>

 #include <map>

 #include <queue>

 #include <string>

 using namespace std;

 int N,T;

 int len = ;

 int mem,ans;

 void solve(int n)

 {

     int li=,nn = n;

     do{

         mem += n%;

         n/=;

         li++;

     }while(n);

     int t = li;

     while(li--)

     {

         int a = (nn%);

         int b = ((((len+li) % ) == ) ?  : );

         //printf("%d %d\n",nn%10,len+li);

         nn/=;

         ans += (a*b%);

         ans %= ;

     }

     len += t;

 }

 int main()

 {

     int kase = ;

     while(~scanf("%d%d",&N,&T) && N != - && T != -)

     {

         kase ++;

         len = ;

         mem = ;

         ans = ;

         solve(N);

         while(T--) solve(mem);

         ans %= ;

         if(ans == ) printf("Case #%d: Yes\n",kase);

         else printf("Case #%d: No\n",kase);

     }

 }