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;
const long long dx[] = {0, 1, 0, -1};
const long long dy[] = {1, 0, -1, 0};
const long long inf = 0x3f3f3f3f3f3f3f;
const long long N = 2e5 + 11;
long long n, k, dp[N][2];
long long anss = inf;
map<long long, long long> di, insert;
void prec(map<long long, long long> s, long long turn) {
  long long nr = 0;
  long long mn = -1;
  long long ans = 0;
  long long i = (turn == 1 ? n : 1);
  for (auto it : s) {
    long long cur = it.first;
    long long frec = it.second;
    if (mn != -1) {
      ans += nr * (cur - mn);
    }
    nr += frec;
    mn = cur;
    dp[i][turn] = ans;
    if (turn)
      i--;
    else
      i++;
  }
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cerr.tie(0);
  cout.tie(0);
  cin >> n >> k;
  for (long long i = 1, x; i <= n; i++) {
    cin >> x;
    di[x]++;
    insert[-x]++;
    if (di[x] >= k) {
      anss = 0;
    }
  }
  long long len = n;
  n = (long long)((insert).size());
  vector<pair<long long, long long> > v;
  v.push_back(make_pair(0, 0));
  for (auto it : di) {
    v.push_back(make_pair(it.first, it.second));
  }
  prec(di, 0);
  prec(insert, 1);
  for (long long i = 1; i <= n; i++) {
    anss = min(anss, dp[i][0] + dp[i][1] - (len - k));
  }
  long long nr = 0;
  for (long long i = 1; i <= n; i++) {
    if (nr + v[i].second >= k) {
      anss = min(anss, dp[i][0] - (nr + v[i].second - k));
      break;
    }
    nr += v[i].second;
  }
  nr = 0;
  for (long long i = n; i > 0; i--) {
    if (nr + v[i].second >= k) {
      anss = min(anss, dp[i][1] - (nr + v[i].second - k));
      break;
    }
    nr += v[i].second;
  }
  cout << max(0ll, anss) << '\n';
  return 0;
}
