#include <bits/stdc++.h>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 200020;
inline int getans(int x, int y)
{
	if (x <= y)
		return y - x;
	int tmp = 0;
	while (x >= y * 2) {
		tmp++;
		x = x / 2;
	}
	return min(y - (x / 2) + 1, x - y) + tmp;
}
int a[550], res[550];
void solve()
{
	int n, m, mn = inf;
	scanf("%d%d", &n, &m);
	if (n == m) {
		printf("0\n");
		return;
	}
	for (int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
		mn = min(mn, a[i]);
	}
	ll ans = inf;
	map<int, int> mp;
	vector<int> q;
	for (int x = 1; x <= n; x++) {
		q.push_back(a[x]);
		int L = max(a[x] - 29, 1), R = a[x] + 29;
		for (int i = L; i <= R; i++) {
			if (mp.find(i) == mp.end()) {
				mp[i] = 1;
			}
			else {
				if (mp[i] == n - m)
					q.push_back(i);
				mp[i]++;
			}
		}
		int rr = a[x];
		int tmp = 1;
		while (rr >= 1) {
			rr = rr / 2;
			L = max(rr - 29 + tmp, 1), R = rr + 29 - tmp;
			for (int i = L; i <= R; i++) {
				if (mp.find(i) == mp.end()) {
					mp[i] = 1;
				}
				else {
					if (mp[i] == n - m)
						q.push_back(i);
					mp[i]++;
				}
			}
			tmp++;
		}
	}
	for (int i : q) {
		// debug(i);
		for (int j = 1; j <= n; j++) {
			int now = getans(a[j], i);
			// cout << now << " ";
			res[j] = now;
		}
		// cout << endl;
		sort(res + 1, res + n + 1);
		ll sum = 0;
		for (int j = 1; j <= n - m; j++) {
			sum += res[j];
		}
		ans = min(ans, sum);
	}
	printf("%lld\n", ans);
}
signed main()
{
	/*ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);*/
	int T = 1;
	cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}