#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

void solve() {
    ll n, m;cin >> n >> m;
    vector<ll> a(n + 3);
    map<ll, ll> mp;
    ll ans = 1e18;
    for (ll i = 1; i <= n; i++) cin >> a[i];
    auto check = [&](ll x) {
        vector<ll> op(n + 3);
        for (ll i = 1; i <= n; i++) {
            ll res = 0;
            if (a[i] < x) res += x - a[i];
            else {
                ll tmp = 0, t = a[i];
                while (t / 2 >= x) t /= 2, tmp++;
                tmp += min(t - x, x - (t / 2));
                res += tmp;
            }
            op[i] = res;
        }
        sort(op.begin() + 1, op.begin() + n + 1);
        ll q = 0;
        for (ll i = 1; i <= n - m; i++) q += op[i];
        ans = min(ans, q);
        };
    for (ll i = 1; i <= n; i++) {
        ll x = a[i];
        while (x) {
            if (mp[x]) break;
            mp[x] = 1;
            check(x);
            x /= 2;
        }
    }
    cout << ans << endl;
}

int main() {
    ll t;cin >> t;
    while (t--) solve();
}