#include <iostream>
#include <cstdio>
using namespace std;
int n,k;
int dui[1000001],step[1000001];
void init()
{
  scanf("%d %d",&n,&k);
}
void solve()
{
  int head=0,tail=1;
  dui[head]=n;
  while(head!=tail)
  {
    if(dui[head]==k)
    {
      printf("%d",step[head]);
      break;
    }
    if(dui[head]<=k)
    {
      dui[tail]=dui[head]*2;
      step[tail]=step[head]+1;
      tail=(tail+1)%1000000;
    }
    dui[tail]=dui[head]-1;
    step[tail]=step[head]+1;
    tail=(tail+1)%1000000;
    if(dui[head]<=k)
    {
      dui[tail]=dui[head]+1;
      step[tail]=step[head]+1;
      tail=(tail+1)%1000000;
    }
    head=(head+1)%1000000;
  }
}
int main()
{
  init();
  solve();
  return(0);
}