#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), c(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;
        }
        for (int j = 0; j < n; j++) {
            for (int z = 0; z < 2; z++) {
                int v = b[j] >> z;
                if (v == 0) continue;
                int c2 = cnt;
                for (int k = 0; k < n; k++) {
                    if (b[k] / 2 == 0 || abs(b[k] - v) <= abs(b[k] / 2 - v)) {
                        c[k] = b[k];
                    } else {
                        c[k] = b[k] / 2;
                        c2++;
                    }
                }
                sort(c.begin(), c.end());
                int p = -1;
                vector<ll> s(n + 1);
                for (int k = 0; k < n; k++) {
                    s[k + 1] = s[k] + c[k];
                    if (c[k] == v) p = k;
                }
                assert(p != -1);
                for (int k = 0; k <= min(m, p); k++) {
                    if (m - k > n - p - 1) continue;
                    ans = min(ans, (s[n - m + k] - s[p + 1]) - (s[p] - s[k]) + 1LL * v * ((p - k) - ((n - m + k) - (p + 1))) + c2);
                }
            }
            
        }
    }
    cout << ans << "\n";
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
}