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 INF64 = 1e18;
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> a(n);
  for (auto &it : a) cin >> it;
  sort(a.begin(), a.end());
  vector<pair<int, int>> cnt;
  for (auto it : a) {
    if (cnt.empty() || cnt.back().first != it) {
      cnt.push_back({it, 1});
    } else {
      ++cnt.back().second;
    }
  }
  vector<long long> prefsum, sufsum;
  vector<int> prefcnt, sufcnt;
  for (int i = 0; i < int(cnt.size()); ++i) {
    long long cursum = cnt[i].first * 1ll * cnt[i].second;
    int curcnt = cnt[i].second;
    if (prefsum.empty()) {
      prefsum.push_back(cursum);
      prefcnt.push_back(curcnt);
    } else {
      prefsum.push_back(prefsum.back() + cursum);
      prefcnt.push_back(prefcnt.back() + curcnt);
    }
  }
  for (int i = int(cnt.size()) - 1; i >= 0; --i) {
    long long cursum = cnt[i].first * 1ll * cnt[i].second;
    int curcnt = cnt[i].second;
    if (sufsum.empty()) {
      sufsum.push_back(cursum);
      sufcnt.push_back(curcnt);
    } else {
      sufsum.push_back(sufsum.back() + cursum);
      sufcnt.push_back(sufcnt.back() + curcnt);
    }
  }
  reverse(sufsum.begin(), sufsum.end());
  reverse(sufcnt.begin(), sufcnt.end());
  long long ans = INF64;
  for (int i = 0; i < int(cnt.size()); ++i) {
    int cur = max(0, k - cnt[i].second);
    int needl = 0;
    if (i > 0) needl = min(cur, prefcnt[i - 1]);
    int needr = max(0, cur - needl);
    long long res = 0;
    if (i > 0 && needl > 0) {
      res += prefcnt[i - 1] * 1ll * (cnt[i].first - 1) - prefsum[i - 1];
      res += needl;
    }
    if (i + 1 < int(cnt.size()) && needr > 0) {
      res += sufsum[i + 1] - sufcnt[i + 1] * 1ll * (cnt[i].first + 1);
      res += needr;
    }
    ans = min(ans, res);
    needr = 0;
    if (i + 1 < int(cnt.size())) needr = min(cur, sufcnt[i + 1]);
    needl = max(0, cur - needr);
    res = 0;
    if (i > 0 && needl > 0) {
      res += prefcnt[i - 1] * 1ll * (cnt[i].first - 1) - prefsum[i - 1];
      res += needl;
    }
    if (i + 1 < int(cnt.size()) && needr > 0) {
      res += sufsum[i + 1] - sufcnt[i + 1] * 1ll * (cnt[i].first + 1);
      res += needr;
    }
    ans = min(ans, res);
  }
  cout << ans << endl;
  return 0;
}
