Problem: 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

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int inf = 0x3f3f3f3f;
const int maxn = 2e5 + 10;
using namespace std;
int n, k, a[maxn];
vector<int> v[maxn];
int main() {
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  if (k == 1) {
    printf("0\n");
    return 0;
  }
  for (int i = 1; i <= n; i++) {
    int p = a[i], cnt = 0;
    while (p >= 0) {
      v[p].push_back(cnt);
      if (p == 0) break;
      p /= 2;
      cnt++;
    }
  }
  int ans = inf, anss;
  for (int i = 0; i < maxn; i++) {
    if (v[i].size() >= k) {
      sort(v[i].begin(), v[i].end());
      anss = 0;
      for (int j = 0; j < k; j++) anss += v[i][j];
      ans = min(ans, anss);
    }
  }
  printf("%d\n", ans);
  return 0;
}