#include<iostream>
#include<vector>
#include<string>
#include<algorithm>	
#include<map>
#include<set>
#include<utility>
#include<cmath>
#include<cstring>
#include<queue>
#include<cstdio>
#include<sstream>
#include<iomanip>
#define loop(i,a,b) for(int i=a;i<b;i++) 
#define rep(i,a) loop(i,0,a)
#define pb push_back
#define mp make_pair
#define all(in) in.begin(),in.end()
#define shosu(x) fixed<<setprecision(x)
using namespace std;
//kaewasuretyuui
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vp;
typedef vector<vp> vvp;
typedef pair<int,pii> pip;
typedef vector<pip>vip;
const double PI=acos(-1);
const double EPS=1e-8;
const int inf=1e8;
int main(){
	int n,m;
	int cnt=1;
	while(cin>>n>>m,n+m){
		vi in(m+1);
		in[0]=n;
		int out=1;
		while(1){
			vi tmp=in;
			int c=0;
			for(int i=m;i>=1;i--){
				tmp[i]+=tmp[i-1]/2;
				c+=tmp[i-1]/2;
				tmp[i-1]-=tmp[i-1]/2*2;
			}
			tmp[0]+=c;
			in=tmp;
			if(in[m])break;
			out++;
		}
		cout<<"Case "<<cnt<<": "<<out<<endl;;
		cnt++;
	}
}