#include <bits/stdc++.h>
using namespace std;
const long long int MOD = 1e9 + 7;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int n, k;
  cin >> n >> k;
  long long int a[n];
  vector<long long int> all;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    long long int x = a[i];
    while (x > 0) {
      all.push_back(x);
      x = x / 2;
    }
  }
  sort(a, a + n);
  long long int ans = 1e9;
  for (auto x : all) {
    long long int c = 0;
    long long int count = 0;
    for (long long int i = 0; i < n; i++) {
      long long int y = a[i];
      if (x == y) {
        count++;
      } else {
        long long int t = 0;
        while (y > 0) {
          if (x == y) {
            count++;
            c += t;
            break;
          }
          t++;
          y = y / 2;
        }
      }
      if (count >= k) {
        ans = min(ans, c);
        break;
      }
    }
  }
  cout << ans << "\n";
  return 0;
}
