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 int N = 2e5 + 10;
long long n, k, a[N];
long long pre[N], precnt[N];
int b[N], now, num = 1;
long long cnt[N];
long long cal(long long val, int x) {
  if (cnt[x] >= k) return 0;
  int res = k - cnt[x];
  long long q1 = precnt[x - 1] * (val - 1) - pre[x - 1];
  long long q2 = pre[now] - pre[x] - (precnt[now] - precnt[x]) * (val + 1);
  long long ans1 = 0, ans2 = 0, ans3 = 0;
  if (precnt[x - 1] >= res)
    ans1 = q1 + res;
  else
    ans1 = 1e18;
  if (precnt[now] - precnt[x] >= res)
    ans2 = q2 + res;
  else
    ans2 = 1e18;
  ans3 = q1 + q2 + res;
  ans1 = min(ans1, ans2);
  ans1 = min(ans1, ans3);
  return ans1;
}
int main() {
  cin >> n >> k;
  for (int i = 1; i <= n; i++) cin >> a[i];
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) {
    if (a[i] != a[i + 1]) {
      now++;
      b[now] = a[i];
      cnt[now] = num;
      num = 1;
    } else
      num++;
  }
  for (int i = 1; i <= now; i++)
    pre[i] = pre[i - 1] + b[i] * cnt[i], precnt[i] = precnt[i - 1] + cnt[i];
  long long ans = 1e18;
  for (int i = 1; i <= now; i++) {
    ans = min(ans, cal(b[i], i));
  }
  cout << ans << endl;
  return 0;
}
