#include <bits/stdc++.h>

#define f first
#define s second
#define ll long long
#define pb push_back
#define mp make_pair

using namespace std;

const ll INF = 1e18;
ll n, k, a[500000];

int main(){

	cin >> n >> k;
	if (k >= n){
		cout << 1;
		return 0;
	}
	ll ans = INF;

	for (ll j = 1ll; j < k; j++)
	{
		a[0] = j;

		for (ll i = 1; ; i++){

			a[i] = a[i - 1] + min(a[i - 1], (n - a[i - 1]) / 2ll);
			if (n - a[i] <= k - j)
			{
				ans = min(ans, i + 1ll);
				break;
			}
		}
	}
	cout << ans << endl;

	return 0;
}