You are given the array a consisting of n elements and the integer k ≤ n.

You want to obtain at least k equal elements in the array a. In one move, you can make one of the following two operations:

  * Take one of the minimum elements of the array and increase its value by one (more formally, if the minimum value of a is mn then you choose such index i that a_i = mn and set a_i := a_i + 1); 
  * take one of the maximum elements of the array and decrease its value by one (more formally, if the maximum value of a is mx then you choose such index i that a_i = mx and set a_i := a_i - 1). 



Your task is to calculate the minimum number of moves required to obtain at least k equal elements in the array.

Input

The first line of the input contains two integers n and k (1 ≤ k ≤ n ≤ 2 ⋅ 10^5) — the number of elements in a and the required number of equal elements.

The second line of the input contains n integers a_1, a_2, ..., a_n (1 ≤ a_i ≤ 10^9), where a_i is the i-th element of a.

Output

Print one integer — the minimum number of moves required to obtain at least k equal elements in the array.

Examples

Input


6 5
1 2 2 4 2 3


Output


3


Input


7 5
3 3 2 1 1 1 3


Output


4
#include <bits/stdc++.h>
using namespace std;
using Int = long long;
using Float = long double;
void solve() {
  Int n, k;
  cin >> n >> k;
  vector<pair<Int, Int>> A;
  A.push_back(make_pair(0, 0));
  {
    map<Int, Int> mp;
    for (Int(i) = (1); (i) <= (n); (i)++) {
      Int a;
      cin >> a;
      mp[a]++;
    }
    for (auto x : mp) {
      A.push_back(x);
    }
  }
  A.push_back(make_pair(200001, 0));
  Int m = A.size() - 2;
  vector<Int> cuml(m + 2), cumr(m + 2), cntl(m + 2), cntr(m + 2);
  for (Int(i) = (1); (i) <= (m); (i)++) {
    cuml[i] = cuml[i - 1] + A[i].first * A[i].second;
    cntl[i] = cntl[i - 1] + A[i].second;
  }
  for (Int(i) = (m); (i) >= (1); (i)--) {
    cumr[i] = cumr[i + 1] + A[i].first * A[i].second;
    cntr[i] = cntr[i + 1] + A[i].second;
  }
  Int res = Int(1e16);
  for (Int(i) = (1); (i) <= (m); (i)++) {
    Int need = max(0LL, k - A[i].second);
    if (need == 0) {
      cout << 0 << "\n";
      return;
    }
    {
      if (cntl[i - 1] >= need) {
        Int sumk = need * A[i].first;
        Int sumkm1 = (cntl[i - 1] - need) * (A[i].first - 1);
        res = min(res, sumk + sumkm1 - cuml[i - 1]);
      } else {
        Int resl = cntl[i - 1] * A[i].first - cuml[i - 1];
        Int needr = need - cntl[i - 1];
        Int sumkr = needr * A[i].first;
        Int sumkrp1 = (cntr[i + 1] - needr) * (A[i].first + 1);
        Int resr = cumr[i + 1] - (sumkr + sumkrp1);
        res = min(res, resl + resr);
      }
    }
    {
      if (cntr[i + 1] >= need) {
        Int sumk = need * A[i].first;
        Int sumkp1 = (cntr[i + 1] - need) * (A[i].first + 1);
        res = min(res, cumr[i + 1] - (sumk + sumkp1));
      } else {
        Int resr = cumr[i + 1] - cntr[i + 1] * A[i].first;
        Int needl = need - cntr[i + 1];
        Int sumkl = needl * A[i].first;
        Int sumklm1 = (cntl[i - 1] - needl) * (A[i].first - 1);
        Int resl = (sumkl + sumklm1) - cuml[i - 1];
        res = min(res, resr + resl);
      }
    }
  }
  cout << res << "\n";
  return;
}
int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  solve();
  return 0;
}
