#include<cstring>

 #include<cmath>

 #include<algorithm>

 #include<iostream>

 #include<cstdio>

 using namespace std;

 inline int read()

 {

     int x=,f=;char ch=getchar();

     while(ch>''||ch<''){if (ch=='-') f=-;ch=getchar();}

     while(ch<=''&&ch>=''){x=(x<<)+(x<<)+ch-'';ch=getchar();}

     return x*f;

 }

 int n,k;

 int f[][];

 int main()

 {

     n=read(),k=read();

     for (int i=;;i++)

     {

         f[i][]=i/;

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

             f[i][j]=max(f[i-][j]+f[i-][j-],f[i-][j]+f[i-][j-])+;

         if (f[i][k]>=n)

         {

             printf("%d\n",i);

             return ;

         }

     }

 }