#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

int n,m;
LL a[N];
set<LL> H;

auto solve(){
	
	cin >> n >> m;
	for(int i = 1;i <= n;i ++ ) cin >> a[i];
	
	H.clear();
	for(int i = 1;i <= n;i ++ ){
		LL x = a[i];
		while(x > 0){
			H.insert(x);
			x >>= 1;
		}
	}
	
	LL ans = 1e18;
	for(LL h : H){
		vector<LL> cost;
		for(int i = 1;i <= n;i ++ ){
			LL c = 0;
			if(a[i] <= h) c += h - a[i];
			else{
				LL x = a[i];
				while(x / 2 >= h) x /= 2,c ++ ;
				c += min(x - h,h - x / 2);
			}
			cost.push_back(c);
		}
		sort(cost.begin(),cost.end());
		LL res = 0;
		for(int i = 0;i < n - m;i ++ )
			res += cost[i];
		ans = min(ans,res);
	}
	
	cout << ans << '\n';
}

signed main(){
	IOS
	int T = 1;
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}