#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],ans[N],cha[N];
void solve()
{
	cin>>n>>m;
	int geshu=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		int x=a[i];
		while(x){
			ans[++geshu]=x;			//记录最终答案可能的值 
			x/=2;
		}
	}
	
	int minn=1e17;
	for(int i=1;i<=geshu;i++){		//枚举所有最终答案 
		int x=ans[i];
		int cnt=0;
		for(int j=1;j<=n;j++){
			cha[j]=1e10;
			if(a[j]<x)cha[j]=x-a[j];	//小于最终答案的值只能通过+1来操作 
			else if(a[j]==x){
				cha[j]=0;
				continue;
			}
			else {			//大于最终答案的值先不断/2再加减 
				int num=a[j],shu=0;
				while(num>x){
					if(num>x&&(num/2)<=x){
						cha[j]=min(shu+num-x,shu+1+(x-num/2));
						break;
					}
					num/=2;shu++;
				}

			}
		}
		
		sort(cha+1,cha+1+n);
		for(int j=1;j<=n-m;j++)cnt+=cha[j];
		
		minn=min(minn,cnt);

	}
	
	cout<<minn<<endl;
	

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