// author:  jieda
// file:	cpp
//#pragma GCC optimize("O3")
#include<bits/stdc++.h>
using namespace std;
# define fi first
# define se second
# define all(x) x.begin(),x.end()
# define stst stringstream
# define pb push_back
# define pf push_front
# define pp push
# define lowbit(x) (x)&(-x)
# define fa(i,op,n) for (int i = op; i <= n; i++)
# define fb(j,op,n) for (ll j = op; j >= n; j--)
# define fg(i,op,n) for (ll i = op; i != n; i = ne[i])
int dx[4] = {-1,0,1,0},dy[4] = {0,1,0,-1};
typedef unsigned long long  ull;
typedef long long ll;
typedef pair<ll,ll> Pll;
typedef pair<int,int> PII;
typedef pair<double,double> PDD;
const int N = 2e5+10,INF = 0x3f3f3f3f,mod = 1000000007;
const ll MOD = 212370440130137957ll;//hash(hight)
const int base = 131;
const double eps = 1e-10;
const int seed=10086,mo=1e6+7; //hash(lower)
int prime = 233317;
using namespace std;
void solve(){
	int n,m;cin>>n>>m;
	vector<int> a(n+1);
	vector<int> res;
	for(int i = 1;i<=n;i++){
		int x;cin>>x;
		a[i] = x;
		while(x){
		  //  cout<<x<<'\n';
			res.pb(x);
			x /= 2;
		}
	}
	ll ans = 1e9;
	for(auto x:res){
		vector<ll> v(n+1,1e9);
		for(int i = 1;i<=n;i++){
			int y = a[i];
			ll sum = 0;
			while(y>=1){
				v[i] = min(v[i],sum+abs(y-x));
				y /= 2,sum++;
			}
		}
		ll sum = 0;
		for(int i = 1;i<=n-m;i++){
			sum += v[i];
		}
		ans = min(ans,sum);
	}
	cout<<ans<<'\n';
}

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