#include<bits/stdc++.h>
#define ll long long
#define pii_ pair<int,int>
#define mp_ make_pair
#define pb push_back
#define fi first
#define se second
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define show1(a) cout<<#a<<" = "<<a<<endl
#define show2(a,b) cout<<#a<<" = "<<a<<"; "<<#b<<" = "<<b<<endl
using namespace std;
const ll INF = 1LL<<60;
const int inf = 1<<30;
const int maxn = 2e5+5;
inline void fastio() {ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);}

ll n,k;

int main()
{
	fastio();
	cin>>n>>k;
	ll res=INF;
	for(ll i=1;i<k;i++)
	{
		ll now = k-i,ans = 1;
		while(now<n-i){
			now = now + min(now,(n-now)/2);
			ans++;
		}
		res = min(res,ans);
	}
	cout<<res<<endl;
	return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int N = 1e4+5;
int a[N];
typedef unsigned long long ll;
int main()
{
	int n;
	scanf("%d",&n);
	for (int i = 1;i<= n;i++)scanf("%d",&a[i]);
	for (int i = 1;i<= n;i++) {
		int y = i;
		ll ans = 0,x = 1;
		while (y <= n) {
			if (a[y]>=128) {
				ans += (a[y]-128)*x;
				x *= 128;
				y++;
			} else {
				ans += a[y]*x;
				i = y;
				break;
			}
		}
		if (ans & 1) 
			printf("%lld\n",(long long)0-((ans-1)/2+1));
		else 
			printf("%llu\n",ans/2);
	}
	return 0;
}

#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
typedef long long ll;
const int N = 1e5+5;
ll x[N],y[N];
ll T,n;
ll calc(ll x,ll y) {
	if (x > y || y < 0) return 0;
	ll nx = x < 0 ? -x : 0;
	return (x+y)*(y-x+1)/2 + (nx+1)*nx/2;
}
int main()
{
	scanf("%lld",&T);
	ll minn = 0;
	ll maxn = 0;
	int m;
	scanf("%lld%d",&n,&m);
	for (int i = 1;i<= m;i++) {
		scanf("%lld%lld",&x[i],&y[i]);
		minn += y[i];
		maxn += y[i];
	}
	for (int i = 1;i < m;i++) {
		ll dis = x[i+1]-x[i];
		ll val = abs(y[i+1]-y[i]);
		if (val > dis) {
			printf("No\n");
			return 0;
		}
		if (dis == 1) { continue; }
		ll maxx = max(y[i+1],y[i]) + (dis-val)/2;
		ll minx = min(y[i+1],y[i]) - (dis-val)/2;
		if (val % 2 == dis % 2) {
			maxn += calc(max(y[i+1],y[i]),maxx) + calc(min(y[i+1],y[i]),maxx) - max(maxx,0ll);
			minn += calc(minx,max(y[i+1],y[i])) + calc(minx,min(y[i+1],y[i])) - max(minx,0ll);
 
		} else {
			maxn += calc(max(y[i+1],y[i]),maxx) + calc(min(y[i+1],y[i]),maxx);
			minn += calc(minx,max(y[i+1],y[i])) + calc(minx,min(y[i+1],y[i]));
		}
		maxn -= y[i+1]+y[i];
		minn -= y[i+1]+y[i];
	}
	maxn += calc(y[1]+1,y[1]+x[1]-1);
	minn += calc(y[1]-x[1]+1,y[1]-1);
	maxn += calc(y[m]+1,y[m]+n-x[m]);
	minn += calc(y[m]-n+x[m],y[m]-1);
	if (T<= maxn && T >= minn) { printf("Yes\n"); }
	else { printf("No\n"); }
	return 0;
}