#include <bits/stdc++.h>
#define int long long

using namespace std;

inline int read () {
    int w = 1, s = 0; char ch = getchar ();
    for (; ! isdigit (ch); ch = getchar ()) if (ch == '-') w = -1;
    for (; isdigit (ch); ch = getchar ()) s = (s << 1) + (s << 3) + (ch ^ 48);
    return s * w;
}

void solve () {
    int n = read (), m = read ();

    vector <int> all;
    vector <int> a (n);
    for (int i = 0; i < n; i ++) {
        a[i] = read ();
        int t = a[i];
        while (t) {
            all.push_back (t);
            t /= 2;
        }
    }

    sort (all.begin (), all.end ());
    all.erase (unique (all.begin (), all.end ()), all.end ());

    int ans = 1E18;

    for (auto x : all) {
        vector <int> b;
        for (int y : a) {
            int sum = 0;
            if (y <= x) {
                sum = abs (x - y);
            } else {
                int s1 = 0, s2 = 0;
                int t1 = y, t2 = y;
                while (t1 >= y) {
                    if (t1 / 2 < x) {
                        t1 /= 2;
                        s1 ++;
                        break;
                    }
                    t1 /= 2;
                    s1 ++;
                    t2 /= 2;
                    s2 ++;
                }
                sum = min (s1 + abs (x - t1), s2 + abs (x - t2));
            }
            b.push_back (sum);
        }
        sort (b.begin (), b.end (), greater ());
        int sum = accumulate (b.begin (), b.end (), 0LL);
        for (int i = 0; i < m; i ++) {
            sum -= b[i];
        }
        ans = min (ans, sum);
    }

    printf ("%lld\n", ans);
} 

signed main () {
	// ios::sync_with_stdio (false);
    // cin.tie (nullptr);
    
	int T = 1; 
	// cin >> T;
	T = read ();

	while (T --) {
		solve ();
	}
	
	return 0;
}