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 INF = 57 * 1e8;
void find_available_x(vector<vector<int>>& v, int x) {
  int count_operations = 0;
  while (x > 0) {
    v[x].push_back(count_operations);
    x /= 2;
    ++count_operations;
  }
}
int sum_count_operation_for_each_elem(vector<int> v, int k) {
  int sum = 0;
  for (int i = 0; i < k; ++i) {
    sum += v[i];
  }
  return sum;
}
int main() {
  int n, k;
  cin >> n >> k;
  vector<int> v(n);
  vector<vector<int>> available_x(2 * 1e5 + 57, vector<int>());
  for (int i = 0; i < n; ++i) {
    cin >> v[i];
    find_available_x(available_x, v[i]);
  }
  int min_count_operation = INF;
  for (int i = 0; i < available_x.size(); ++i) {
    if (available_x[i].size() >= k) {
      sort(available_x[i].begin(), available_x[i].end());
      min_count_operation =
          min(min_count_operation,
              sum_count_operation_for_each_elem(available_x[i], k));
    }
  }
  cout << min_count_operation;
  return 0;
}
