#include <cmath>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <map>
#include <stack>
#include <vector>
#include <algorithm>
#include <queue>
#include <bitset>
using namespace std;
const int N = 500 + 9;
typedef long long ll;
int read() {
  int x = 0, s = 1; char ch = getchar();
  for (; !isdigit(ch); ch = getchar()) if (ch == '-') s = -1;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + (ch ^ 48);
  return x * s; 
}

int n, m, a[N], pre[N];

void solve() {
  cin >> n >> m;
  vector<int> cho;
  for (int i = 1; i <= n; ++i)
    cin >> a[i];
  sort(a + 1, a + 1 + n);
  n -= m;
  for (int i = 1; i <= n; ++i) {
    pre[i] = pre[i - 1] + a[i];
    int x = a[i];
    while (x) {
      for (int j = -n * 30; j <= n * 30; ++j) {
        if (x + j >= 1)
          cho.push_back(a[i] + j);
      }
      x >>= 1;
    }
    for (int j = 0; j < 60; ++j)
      cho.push_back(i + j * n);
  }
  
  sort(cho.begin(), cho.end());
  cho.erase(unique(cho.begin(), cho.end()), cho.end());
  double t2 = log(2);
  int Ans = 1e9;
  int pos = 1;
  for (int x : cho) {
    int pos = lower_bound(a + 1, a + 1 + n, x) - a;
    while (pos <= n && x > a[pos])
      pos++;
    if (pos > n)
      break;
    if (pos * x - pre[pos] >= Ans)
      break;
    // vector<int> res;
    long long ans = 0;
    for (int i = 1; i <= n; ++i) {
      if (a[i] <= x) {
        // res.push_back(x - a[i]);
        ans += x - a[i];
      } else {
        int t = log(1.0 * a[i] / x) / t2;
        int r = min(abs((a[i] >> t) - x) + t, abs((a[i] >> t + 1) - x) + t + 1);
        if (t)
          r = min(r, abs((a[i] >> t - 1) - x) + t - 1);
        // res.push_back(r);
        ans += r;
      }
    }
    // nth_element(res.begin(), res.begin() + n - m, res.end());
    
    // for (int i = 0; i < n - m; ++i)
    //   ans += res[i];
    Ans = min(1LL * Ans, ans);
    // cout << ans << ' ';
  }
  
  cout << Ans << '\n';
}

int T;
int main() {
  ios::sync_with_stdio(false);
  cin >> T;
  while (T--)
    solve();
  return 0;
}