#include <bits/stdc++.h>
using namespace std;
using ll = long long;
void solve() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n);
    for (int &i : a) cin >> i;
    ll ans = 1e18;
    for (int i = 0; i < 30; i++) {
        vector<int> b(n);
        int cnt = 0;
        for (int j = 0; j < n; j++) {
            int k = __lg(a[j]);
            b[j] = k <= i ? a[j] : (a[j] >> (k - i));
            if (k > i) cnt += k - i;
        }
        sort(b.begin(), b.end());
        if (b[0] == 0) continue;
        vector<ll> s(n + 1);
        for (int j = 0; j < n; j++) {
            s[j + 1] = s[j] + b[j];
        }
        for (int j = 0; j < n; j++) {
            for (int k = 0; k <= min(m, j); k++) {
                if (m - k > n - j - 1) continue;
                ans = min(ans, (s[n - m + k] - s[j + 1]) - (s[j] - s[k]) + 1LL * b[j] * ((j - k) - ((n - m + k) - (j + 1))) + cnt);
            }
        }
    }
    cout << ans << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}