#include<bits/stdc++.h>
#include<unordered_map>
typedef long long ll;
typedef long double ld;
#define debug(a) cout<<a<<'\n'
#define Pll pair<ll,ll>
#define PII pair<int,int>
#define FI(i,b,e,s) for(int i=b;i<=e;i+=s)
#define FD(i,b,e,s) for(int i=b;i>=e;i-=s)
#define ft first
#define sd second
#define vec vector
using namespace std;
const int N = 2e4 + 10, M = 4e5, mod = 1e9 + 7;
const ll inf = 1e18;
const ld eps = 1e-8;
int mov[4][2] = { {0,1},{1,0},{-1,0},{0,-1} }, dx, dy;
ll n, m, k;
ll a[N], q[N], idx,b[N];
ll ans = 0;

int cul(int x,int y) {
	int res = 1e7,d=0;
	while (x > y) {
		res = min(res, x - y + d);
		++d;
		x >>= 1;
	}
	res = min(res, y - x + d);
	return res;
}

ll sol(int x) {
	ll res = 0;
	for (int i = 1; i <= n; ++i) {
		b[i] = cul(a[i], x);
		res += b[i];
	}
	sort(b + 1, b + n + 1);
	for (int i = n; i >= n - m + 1; --i)res -= b[i];
	return res;
}

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
#ifndef ONLINE_JUDGE
	streambuf* cinbackup = cin.rdbuf(), * coubackup = cout.rdbuf();
	ifstream fin("in.txt");
	ofstream fout("out.txt");
	cin.rdbuf(fin.rdbuf());
	cout.rdbuf(fout.rdbuf());
#endif
	int _ = 1, __ = 1;
	cin >> _;
	string s1, s;
	while (_--) {
		ll x, y, z;
		x = y = z = 0;
		ans = inf;
		cin >> n >> m;
		for (int i = 1; i <= n; ++i)cin >> a[i];
		unordered_map<int, bool>mp;
		for (int i = 1,v; i <= n; ++i) {
			x = a[i];
			while (x) {
				if (!mp[x]) { q[++idx] = x; mp[x] = 1; }
				x >>= 1;
			}
		}
		for (int i = 1; i <= idx; ++i) {
			ans = min(ans, sol(q[i]));
		}
		cout << ans << '\n';
	}
	return 0;
}