#include <iostream>

 #include <algorithm>

 #include <cmath>

 #define MAXN 50

 using namespace std;

 int dp[MAXN][MAXN];

 int main()

 {

     //freopen("acm.acm","r",stdin);

     int g;

     int l;

     int i;

     int j;

     int time = ;

     while(cin>>g>>l)

     {

         dp[][] = ;

         if(g ==  && l == )

         {

             break;

         }

         for(i = ; i <= g; ++ i)

         {

             dp[i][] = i;

         }

         for(i = ; i <= g; ++ i)

         {

             for(j = ; j <= l; ++ j)

             {

                 if(j >= i)

                 {

                     dp[i][j] = pow((double),i)-;

                 }

                 else

                 {

                     dp[i][j] = dp[i-][j-]+dp[i-][j]+;

                 }

             }

         }

         cout<<"Case "<<++ time<<": ";

         cout<<dp[g][l]<<endl;

     }

 }