#include<bits/stdc++.h>
#define fa(i,op,n) for(int i=op;i<=n;i++)
#define fb(i,op,n) for(int i=op;i>=n;i--)
#define endl '\n'
#define pb push_back
#define var auto
using namespace std;
using ll = long long;
using pii = pair<int, int>;

const int N = 510;

int n, m;
ll a[N];
ll f1[N][N], f2[N][N];
ll zhi1[N][N], zhi2[N][N];
ll cnt;

ll getcnt(ll a, ll b)
{
	if (a == 0 || b == 0) return 0;
	ll ans = 0;
	while (a != b)
	{
		if (a > b)
		{
			if (a - b == 1)
			{
				ans++;
				return ans;
			}
			else
			{
				a /= 2;
				ans++;
			}
		}
		else
		{
			if (b - a == 1)
			{
				ans++;
				return ans;
			}
			else
			{
				b /= 2;
				ans++;
			}
		}
	}
	return ans;
}

ll getzhi1(ll a, ll b)
{
	if (a == 0) return b;
	else if (b == 0) return a;
	while (a != b)
	{
		if (a > b)
		{
			if (a - b == 1) return a;
			else a /= 2;
		}
		else
		{
			if (b - a == 1) return b;
			else b /= 2;
		}
	}
	return a;
}

ll getzhi2(ll a, ll b)
{
	if (a == 0) return b;
	else if (b == 0) return a;
	while (a != b)
	{
		if (a > b)
		{
			if (a - b == 1) return b;
			else a /= 2;
		}
		else
		{
			if (b - a == 1) return a;
			else b /= 2;
		}
	}
	return a;
}

void solve() 
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++) cin >> a[i];
	sort(a + 1, a + 1 + n);
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= m; j++)
		{
			f1[i][j] = f1[i - 1][j] + getcnt(a[i], zhi1[i - 1][j]);
			zhi1[i][j] = getzhi1(a[i], zhi1[i - 1][j]);
			if (j > 0)
			{
				if (f1[i][j] > f1[i - 1][j - 1])
				{
					f1[i][j] = f1[i - 1][j - 1];
					zhi1[i][j] = zhi1[i - 1][j - 1];
				}
			}
		}
	}

	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j <= min(i,m); j++)
		{
			f2[i][j] = f2[i - 1][j] + getcnt(a[i], zhi2[i - 1][j]);
			zhi2[i][j] = zhi2[i - 1][j];
			zhi2[i][j] = getzhi2(a[i], zhi2[i - 1][j]);
			if (j > 0)
			{
				if (f2[i][j] > f2[i - 1][j - 1])
				{
					f2[i][j] = f2[i - 1][j - 1];
					zhi2[i][j] = zhi2[i - 1][j - 1];
				}
			}
		}
	}

	//for (int i = 1; i <= n; i++)
	//{
	//	for (int j = 0; j <= m; j++)
	//		cout << f1[i][j] << ' ';
	//	cout << '\n';
	//}

	//cout << f1[n][m] << ' ' << f2[n][m] << '\n';

	cout << min(f1[n][m], f2[n][m]) << '\n';
}
int main() {
	ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
	int _ = 1;
	cin >> _;
	while (_--)
	{
		solve();
	}
	return 0;
}