#include <iostream>
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define max 100000
bool visited[max];
int deep[max];
int N,K;
int bfs(){
int count = 0;
queue<int> q;
q.push(N);
memset(deep,0,sizeof(deep));
memset(visited,false,sizeof(visited));
visited[N] = true;
deep[N] = 0;
int s = 1;
while(!q.empty()){
int tp = q.front();
q.pop();
visited[tp] = true;
if(tp == K)
break;
else{
int ans1 = tp + 1;
int ans2 = tp - 1;
int ans3 = tp * 2;
if(ans1 <= 100000&&!visited[ans1]){
deep[ans1] = deep[tp] + 1;
q.push(ans1);
visited[ans1] = true;
}
if(ans2 >= 0&&!visited[ans2]){
deep[ans2] = deep[tp] + 1;
q.push(ans2);
visited[ans2] = true;
}
if(ans3 <= 100000&&!visited[ans3]){
deep[ans3] = deep[tp] + 1;
q.push(ans3);
visited[ans3] = true;
}
}
}
return deep[K];
}
int main() {
cin>>N>>K;
cout<<bfs()<<endl;
return 0;
}
#include <stdio.h>
#include <string.h>
#include <queue>
using namespace std;
#define max 100000
bool visited[max];
int deep[max];
int N,K;
int bfs(){
int count = 0;
queue<int> q;
q.push(N);
memset(deep,0,sizeof(deep));
memset(visited,false,sizeof(visited));
visited[N] = true;
deep[N] = 0;
int s = 1;
while(!q.empty()){
int tp = q.front();
q.pop();
visited[tp] = true;
if(tp == K)
break;
else{
int ans1 = tp + 1;
int ans2 = tp - 1;
int ans3 = tp * 2;
if(ans1 <= 100000&&!visited[ans1]){
deep[ans1] = deep[tp] + 1;
q.push(ans1);
visited[ans1] = true;
}
if(ans2 >= 0&&!visited[ans2]){
deep[ans2] = deep[tp] + 1;
q.push(ans2);
visited[ans2] = true;
}
if(ans3 <= 100000&&!visited[ans3]){
deep[ans3] = deep[tp] + 1;
q.push(ans3);
visited[ans3] = true;
}
}
}
return deep[K];
}
int main() {
cin>>N>>K;
cout<<bfs()<<endl;
return 0;
}