#include<bits/stdc++.h>
using namespace std;
int f[1010][1010];//i个蛋，j层
int main()
{
    freopen("eagleegg.in","r",stdin);
    freopen("eagleegg.out","w",stdout);
    for(int i=1;i<=1010;i++)
    {
        f[1][i]=i;
        f[i][1]=1;
        f[i][0]=0;
    }
    for(int i=2;i<=1010;i++)
    {
        for(int j=2;j<=1010;j++)
        {
            int mn=1020;
            for(int w=1;w<=j;w++)
            {
                mn=min(mn,max(f[i-1][w-1],f[i][j-w]));
            }
            f[i][j]=mn+1;
        }
    }
    int a,b;
    while(cin>>a>>b)
    {
        cout<<f[a][b]<<endl;
    }
 }