#include <map>
#include <set>
#include <queue>
#include <deque>
#include <cmath>
#include <vector>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <unordered_map>
using namespace std;
#define fi first
#define se second
#define u1 (u<<1)
#define u2 (u<<1|1)
#define pb push_back
#define pp pop_back()
#define int long long
#define laile cout<<"laile"<<endl
#define lowbit(x) ((x)&(-x))
#define double long double
#define sf(x) scanf("%lld",&x)
#define sff(x,y) scanf("%lld %lld",&x,&y)
#define sd(x) scanf("%Lf",&x)
#define sdd(x,y) scanf("%Lf %Lf",&x,&y)
#define _for(i,n) for(int i=0;i<(n);++i)
#define _rep(i,a,b) for(int i=(a);i<=(b);++i)
#define _pre(i,a,b) for(int i=(a);i>=(b);--i)
#define all(x) (x).begin(), (x).end()
#define IOS ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
typedef unsigned long long ULL;
typedef pair<int,int>PII;
const int N=1e6+10,INF=4e18;
int n,m;
int q[N];
vector<int>v;
int cal(int x)
{
	vector<int>res;
	_rep(i,1,n)
	{
		int now=q[i],ma=INF,op=0;
		ma=min(ma,abs(now-x));
		while(1)
		{
			now/=2;
			op++;
			ma=min(ma,op+abs(now-x));
			if(now<q[i])break;
		}
		res.pb(ma);
	}
	sort(all(res));
	int ans=0;
	for(int i=0;i<n-m;i++)
		ans+=res[i];
	return ans;
}
void solve()
{
	cin>>n>>m;
	v.clear();
	_rep(i,1,n)
	{
		cin>>q[i];
		int x=q[i];
		while(x)
		{
			v.pb(x);
			x/=2;
		}
	}
	sort(all(v));
	int res=INF;
	v.erase(unique(all(v)),v.end());
	for(auto i:v)
		res=min(res,cal(i));
	cout<<res<<'\n';
	return ;
}
signed main()
{
	IOS;
	int T=1;
	cin>>T;
	while(T--)
		solve();
	return 0;
}