#include<bits/stdc++.h>
#define int long long
#define fast ios::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define N 100007
using namespace std;

void solve(){
    int n,m;cin>>n>>m;
    set<int>se;
    int ac[n+1]={0};
    for(int i=0;i<n;i++){
        int x;cin>>x;
        ac[i]=x;
        while(x){
            se.insert(x);
            x>>=1;
        }
    }
    int minn=0x3f3f3f3f;
    int jjj=se.size();
    for(int i=0;i<jjj;i++){
        multiset<int>rankk;
        int mc=*se.begin();
        //cout<<mc<<" ";
        se.erase(se.begin());
        for(int j=0;j<n;j++){
            int point=0;
            int ace=ac[j];
           // cout<<"mc="<<mc<<"ace="<<ace<<endl;
            if(ace>mc){
                while(ace/2>=mc)point++,ace/=2;
                point+=min(mc-ace/2,ace-mc);
            }
            else if(ace<mc)point+=mc-ace;  
            //cout<<"point="<<" "<<point<<endl;
            rankk.insert(point);
        }int tem=0;
        for(int j=0;j<n-m;j++){
            tem+=*rankk.begin();
            //cout<<*rankk.begin()<<" ";
            rankk.erase(rankk.begin());
        }//cout<<"?"<<endl;
       // cout<<endl;
        minn=min(minn,tem);
    }//cout<<endl;
    cout<<minn<<endl;
    if(se.size())se.clear();
}
signed main(){
    fast;int t;cin>>t;while(t--){solve();} return 0;
}