//
/*
By:Luckyblock
*/
#include <bits/stdc++.h>
#define LL long long
#define pr std::pair
#define mp std::make_pair
const int kN = 510;
const LL kInf = 1e18;
//=============================================================
int n, m, a[kN];
bool vis[kN];
struct Data {
  int id, v, c;
};
LL ans;
//=============================================================
void solve(int v_) {
  std::vector<Data> vec;
  for (int i = 1; i <= n; ++ i) {
    if (a[i] < v_) {
      vec.push_back((Data) {i, v_, v_ - a[i]});
      
    } else if (a[i] < 2 * v_) {
      vec.push_back((Data) {i, a[i], 0});
      vec.push_back((Data) {i, v_, 1 + v_ - a[i] / 2});
  
    } else {
      int b = a[i], c = 0;
      while (b >= 4 * v_) b /= 2, ++ c;
      vec.push_back((Data) {i, 2 * v_ - 1, c + b - 2 * v_ + 1});
      while (b >= 2 * v_) b /= 2, ++ c;
      vec.push_back((Data) {i, b, c});
      while (b > v_) b /= 2, ++ c;
      vec.push_back((Data) {i, v_, c + v_ - b});
    }
  }
  
  for (auto [id, v, c]: vec) {
    LL sum = c;
    std::vector<pr <int, int> > temp;
    for (auto [id1, v1, c1]: vec) {
      if (id1 == id) continue;
      temp.push_back(mp(c1 + abs(v - v1), id1));
      vis[id1] = 0;
    }
    std::sort(temp.begin(), temp.end());
    int cnt = 0;
    for (int i = 0, sz = temp.size(); i < sz && cnt < n - m - 1; ++ i) {
      if (vis[temp[i].second]) continue;
      vis[temp[i].second] = 1;
      sum += 1ll * temp[i].first;
      ++ cnt;
    }
    if (cnt == n - m - 1) ans = std::min(ans, sum);
  }
}
//=============================================================
int main() {
  // freopen("1.txt", "r", stdin);
  std::ios::sync_with_stdio(0), std::cin.tie(0);
  int T; std::cin >> T;
  while (T --) {
    std::cin >> n >> m;
    for (int i = 1; i <= n; ++ i) std::cin >> a[i];
    
    ans = kInf;
    for (int i = 0; i < 30; ++ i) solve((1ll << i));
    std::cout << ans << '\n';
  }
  return 0;
}
/*
1
2 0
2 6

*/