#include<iostream>#include<cstdio>#include<cstring>#include<cmath>#include<algorithm>#include<bitset>using namespace std;int main(){int dp[ 32 ][ 32 ];int i , j ;memset( dp , 0 , sizeof( dp ) ) ;for( i = 0 ; i < 32 ; ++i )dp[ i ][ 0 ] = i ;for( i = 1 ; i < 32 ; ++i ){for( j = 1 ; j <= i ; ++j )dp[ i ][ j ] = dp[ i - 1 ][ j ] + dp[ i - 1 ][ j - 1 ] + 1 ;for( ; j < 32 ; ++j )dp[ i ][ j ] = dp[ i ][ i ] ;}int g , l ;int temp = 1 ;while( cin >> g >> l ){if( !( g + l ) )return 0 ;printf("Case %d: %dn", temp ++ , dp[ g ][ l ] ) ;} }
