#include<bits/stdc++.h>
using namespace std;
const int maxn=1010;
int f[maxn+1][maxn+1]={0};
int main()
{
	freopen("eagleegg.in","r",stdin);
	freopen("eagleegg.out","w",stdout);
	
	for(int i=1;i<=maxn;i++)
	  for(int j=1;j<=maxn;j++)
	    f[i][j]=f[i][j-1]+f[i-1][j-1]+1;
	    
	int a,b;
	while(cin>>a>>b)
	{
		if(a==0&&b==0)break;
		else
		{
			int k;
			for(k=1;;k++)
			  if(f[a][k]>=b){cout<<k<<endl;break;}
		}	
	}
	
	return 0;
}