#include<iostream>

 #include<cstdio>

 using namespace std;

 typedef unsigned long long ll;

 ll dp[][]={};

 int main()

 {

     int n,back;

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

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

         dp[i][j]=;

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

     for (int j=;j<=;j++){

         ll sum=;

         for(int k=;k<=j;k++)

             if(i-k<) sum+=;

         else sum+=dp[i-k][j];

         dp[i][j]=sum+;

     }

     int cas=;

     while(scanf("%d%d",&n,&back)==)

     {

         if(n>) break;

         if(n<) n=;

         cout<<"Case "<<cas++<<": "<<dp[n][back]<<endl;

     }

     return ;

 }