#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
#define int long long
#define lowbit(x) (x&(-x))
#define pll pair<int,int>

const int N = 1e6   +10;
const int mod =    1e9+7;
const double eps = 1e-6;

int dx[] = {-1,1,0,0,-1,-1,1,1};
int dy[] = {0,0,-1,1,-1,1,-1,1};

int n,m,k;
int a[N];

void solve(){
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i];
    sort(a+1,a+1+n);
    auto check = [&](int x) -> int{
        priority_queue<int> q;
        int res = 0;
        for(int i=1;i<=n;i++){
            int ned = 1e18;
            if(a[i]==x) ned = 0;
            else if(a[i]<x) ned = x-a[i];
            else{
                int t = a[i];
                int cnt = 0;
                while(t){
                    ned = min(ned,cnt+abs(t-x));
                    t /= 2;
                    cnt++;
                }
                ned = min(ned,cnt+abs(t-x));
            }
            res += ned;
            q.push(ned);
        }
        int c = m;
        while(q.size()&&c-->0){
            res -= q.top();
            q.pop();
        }
        return res;
    };
    int ans = 1e18;
    for(int i=1;i<=n;i++){
        ans = min(ans,check(a[i]));
    }
    cout<<ans<<"\n";
}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(NULL); cout.tie(NULL);
    int T = 1;
    cin>>T;
    while(T--){
        solve();
    }
    return 0; 
}
/*
3
2 0
2 6
5 0
1 2 3 4 5
5 3
1 2 3 4 5
   /\_/\
  (= ._.)
  / >  \>
*/