#include<bits/stdc++.h>
using namespace std;
using ll = long long int;
using ld = long double;
const ll MAX = 50000000000000;
ll MOD = 1000000007;
ll X,Y;
map<ll,ll> memo;
ll T(ll a){
    if(memo[a] != 0) return memo[a] - 100;
    ll b;
    if(a == 1) b = abs(X - 1);
    else if(a % 2 == 0) b = min(abs(a - X),1 + T(a / 2));
    else b = min({abs(a - X),2 + T((a - 1) / 2),2 + T((a + 1) / 2)});
    memo[a] = b + 100;
    return b;
}
int main(){
    cin >> X >> Y;
    cout << T(Y) << endl;
}

#include <bits/stdc++.h>
//#include <atcoder/all>

using namespace std; 

typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef vector<PII> VPII;
typedef long long LL;
typedef vector<LL> VL;
typedef vector<VL> VVL;
typedef pair<LL, LL> PLL;
typedef vector<PLL> VPLL;
typedef priority_queue<LL> PQ_DESC;
typedef priority_queue<LL, VL, greater<LL>> PQ_ASC;
typedef priority_queue<PII> PQ_DESC_PII;
typedef priority_queue<PII, vector<PII>, greater<PII>> PQ_ASC_PII;
typedef priority_queue<VL> PQ_DESC_VL;
typedef priority_queue<VL, vector<VL>, greater<VL>> PQ_ASC_VL;
typedef priority_queue<PLL> PQ_DESC_PLL;
typedef priority_queue<PLL, vector<PLL>, greater<PLL>> PQ_ASC_PLL;

#define ALL(c) (c).begin(),(c).end()
#define PB push_back
#define MP make_pair
#define SORT_ASC(c) sort(ALL(c))
//#define SORT_DESC(c) sort(ALL(c), greater<typeof(*((c).begin()))>())
#define SORT_DESC(c) sort((c).rbegin(),(c).rend())
#define REV(c) reverse((c).begin(), (c).end())
#define SIZE(a) LL((a).size())

#define FOR(i,a,b) for(LL i=(a);i<(b);++i)
#define ROF(i,a,b) for(LL i=(b-1);i>=(a);--i)
#define REP(i,n) FOR(i,0,n)
#define PER(i,n) ROF(i,0,n)

const double EPS = 1e-10;
const double PI  = acos(-1.0);
const LL LARGE_INT = 1e9+100;
const LL INF = 2e9+100;
const LL INF_LL = (LL)INF*(LL)INF;
const LL MOD = 1e9+7;

//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

LL modpow(LL a, LL n) {
    LL res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % MOD;
        a = a * a % MOD;
        n >>= 1;
    }
    return res;
}

void Main()
{
    LL n,k;cin>>n>>k;
    map<LL,LL> a;
    REP(i,n){
        LL t;cin>>t;
        a[t]++;
    }

    LL point = 0;
    VL result;
    LL now = k;
    for(auto x : a){
        LL s = SIZE(result);
        if(x.first != point){
            REP(i,now){
                result.PB(point);
            }
            now = 0;
            break;
        }

        if(x.second < now){
            REP(i,now-x.second){
                result.PB(point);
            }
            now = x.second;
        }
        point++;
        //dump(x.first)
        //dump(x.second)
        //dump(now)
    }
    REP(i,now){
        result.PB(point);
    }


    LL sum = 0;
    for(auto x : result){
        sum += x;
    }

    cout<<sum<<endl;





    
    
	return;
}

int main()
{
	cin.tie(nullptr);
	ios_base::sync_with_stdio(false);
	cout << fixed << setprecision(15);
	Main();
    return 0;
}