#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 510
#define ll long long
using namespace std;

ll n,m;
ll a[N],b[N];

ll find(ll x,ll aim){
	if(aim>=x) return aim-x;
	ll tmp=x,cnt=0;
	while(tmp-aim-1>abs(tmp/2-aim)&&tmp>aim){
		tmp/=2;
		cnt++;
	}
	return cnt+abs(tmp-aim);
}

ll check(ll aim){
	for(int i=0;i<n;i++) b[i]=find(a[i],aim);
	sort(b,b+n);
	ll cnt=0;
	for(int i=0;i<n-m;i++) cnt+=b[i];
	return cnt;
}

void sol(){
	ll l=0,r=1e9;
	ll ans=1e18;
	while(l!=r){
		ll mid1=l+(r-l)/3,mid2=l+(r-l)/3*2;
		if(r-l==2){
			ans=min(ans,check(l));
			ans=min(ans,check(r));
			ans=min(ans,check(l+1));
			break;
		}
		if(r-l==1){
			ans=min(ans,check(l));
			ans=min(ans,check(r));
			break;
		}
		ll chk1=check(mid1),chk2=check(mid2);
		ans=min(chk1,ans);
		ans=min(chk2,ans);
		if(chk1<chk2){
			r=mid2;
			continue;
		}
		if(chk1>chk2){
			l=mid1;
			continue;
		}
		if(chk1==chk2){
			l=mid1;
			r=mid2;
			continue;
		}
	}
	cout<<ans<<endl;
}

int main(){
	int T; cin>>T;
	while(T--){
		cin>>n>>m;
		for(int i=0;i<n;i++){
			cin>>a[i];
		}
		sol();
	}
	return 0;

}