#include <bits/stdc++.h>
using namespace std;

const int N = 505;
using ll = long long;

int a[N];

void solve() {
	int n, m;
	vector<int> vec;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		int x = a[i];
		while (x > 0) {
			vec.push_back(x);
			x >>= 1;
		}
	}
	
	ll ans = 1e18;
	for (auto v : vec) {
		ll cost = 0;
		priority_queue<int> q;
		for (int i = 1; i <= n; i++) {
			int now = a[i], tmp = 0;
			
			while (now / 2 >= v) {
				tmp++;
				now /= 2;
			}
			
			while (now * 2 <= v) {
				tmp++;
				now *= 2;
			}
			
			tmp += abs(now - v);
			
			q.push(tmp);
			cost += tmp;
		}
		
		for (int i = 0; i < m; i++) {
			if (q.empty()) break ;
			cost -= q.top();
			q.pop();
		}
		
		ans = min(ans, cost);
	}
	cout << ans << '\n';
}

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