#include<bits/stdc++.h>
using namespace std;
#define int long long
#define fer(i,a,b) for(int i=a;i<=b;i++)
#define fdr(i,a,b) for(int i=a;i<=b;i++)
#define pb push_back
#define endl '\n'
const int N=510;
const int INF=1e18+10;

int n,m;
int a[N];

int get(int x,int y){
	if(x==y) return 0;
	if(x<y) swap(x,y);
	int res=x-y;
	int cnt=0;
	while(x>y){
		x/=2;
		cnt++;
		res=min(abs(x-y)+cnt,res);
	}
	return res;
	
}

void solve(){
	cin>>n>>m;
	fer(i,1,n) cin>>a[i];
	int ans=INF;
	fer(i,1,n){
		int x=a[i];
		while(x){
			vector<int> v;
			int sum=0;
			fer(j,1,n) v.pb(get(a[j],x));
			sort(v.begin(),v.end());
			for(int j=0;j<n-m;j++) sum+=v[j];  
			ans=min(ans,sum);	
			x/=2;
		}
	}
	cout<<ans<<endl;
}

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