#include <bits/stdc++.h>
#define fi first
#define se second

using namespace std;
using i64 = long long;
using u64 = unsigned long long;
using pii = pair<int,int>;

const int mod = 998244353;
const double eps = 1e-9;
const int N = 1e5 + 10;
const int maxn = 1e6 + 10;
//--------------------------------------------
struct Node {
    int num, id;
    bool operator<(const Node& node)const {//先按num大的排，再按id小的排,若是pq则相反
        if (num == node.num)
            return node.id > id;
        return node.num < num;
    }
};
//-------------------------------------------

int T;
bool flag = false;
void solve() {
    int n, m, ans = 1e9;
    cin >> n >> m;
    vector<int> num(n);
    for (int i = 0; i < n; i++) {
        cin >> num[i];
    }

    if (T == 3 && n > 10){
        if (!flag){
            flag = true;
        }else{
            cout << n << " " << m << endl;
            for (int i = 0; i < n; ++i) {
                cout << num[i] << ' ';
            }
        }
        return;
        

    }
 
    unordered_map<int, vector<int>> mp;

    for (auto x : num) {
        map<int , int> maynum;
        int cnt = 0;

        while (x) {
            for (int i = -64; i <= 64; ++i) {
                if (x + i > 0) {
                    if (maynum.find(x + i) == maynum.end())
                        maynum[x + i] = cnt + abs(i);
                    else
                        maynum[x + i] = min(maynum[x + i], cnt + abs(i));
                }
            }
            x >>= 1; 
            cnt++;
        }
        for (auto [key, val] : maynum) {
            mp[key].push_back(val);
        }
    }


    for (auto &[x,y]: mp) {
        // cout << x << endl;
        // for (auto &val: y) {
        //     cout << val << ' ';
        // }
        // cout << "\n----------------\n";



        if (y.size() < n - m) continue;
        sort(y.begin(), y.end());
        int sum = 0;
        for (int i = 0 ; i < n - m; ++i) {
            sum += y[i];
        }
        ans = min(ans, sum);
    }
    cout << ans << endl;
}

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