#include<bits/stdc++.h>
using namespace std;
using Int = long long;
template<typename T1,typename T2> inline void chmin(T1 &a,T2 b){if(a>b) a=b;}
template<typename T1,typename T2> inline void chmax(T1 &a,T2 b){if(a<b) a=b;}

//INSERT ABOVE HERE
Int solve(Int h,Int w){
  vector<Int> cnt(w+1,0);
  cnt[0]=h;

  map<vector<Int>, Int> dp;
  queue< vector<Int> > que;
  dp[cnt]=0;
  que.emplace(cnt);
  while(!que.empty()){
    cnt=que.front();que.pop();
    for(Int i=0;i<w;i++){
      if(cnt[i]==0) continue;
      for(Int j=0;j<=w;j++){
        if(abs(i-j)>cnt[i]) continue;
        vector<Int> nxt=cnt;
        nxt[i]--;
        nxt[j]++;
        if(dp.count(nxt)) continue;
        dp[nxt]=dp[cnt]+1;
        que.emplace(nxt);
      }
    }
  }

  cnt.assign(w+1,0);
  cnt[w]=h;
  return dp[cnt];
}

signed main(){
  if(0){
    Int MAX = 10;
    for(Int h=1;h<=MAX;h++){
      for(Int w=1;w<=MAX*2;w++){
        cout<<setw(5)<<solve(h,w)-solve(h,w-1);
      }
      cout<<endl;
    }
  }
  Int h,w;
  cin>>h>>w;
  w=abs(w);
  cout<<solve(h,w)<<endl;
  return 0;
}