#include<bits/stdc++.h>
#define ls p*2
#define rs p*2+1
#define x first
#define y second
#define endl '\n'
using namespace std;

mt19937 rnd(time(0));
typedef long long LL;
typedef unsigned long long  uLL;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
const double PI=acos(-1);
const int N=5e2+10,M=500,MOD=998244353,NN=1e6+10;
LL a[N];
int n;
int m;
LL dp[N][3*N];
int T;
vector<LL>vec;
void init(){
    for(int i=0;i<=n;i++){
        for(int j=0;j<vec.size();j++){
            dp[i][j]=1e14;
        }
    }
    for(int i=1;i<=n;i++){
        for(int k=0;k<=32;k++){
            for(int j=0;j<vec.size();j++){
                LL cur=a[i];
                cur=cur>>k;
                dp[i][j]=min(dp[i][j],(LL)k+abs(cur-vec[j]));
            }
        }
    }
}
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin>>T;
    while(T--){

        cin>>n>>m;
        for(int i=1;i<=n;i++){
            cin>>a[i];
            vec.push_back(a[i]+1);
            vec.push_back(a[i]);
            vec.push_back(a[i]-1);
        }

        init();
        LL ans=1e18;
        for(int i=0;i<vec.size();i++){//最后变成i
            vector<LL>v;
            for(int j=1;j<=n;j++){
                v.push_back(dp[j][i]);
            }
            sort(v.begin(),v.end());
            LL cur=0;
            for(int j=1;j<=n-m;j++){
                cur+=v[j-1];
            }
            ans=min(ans,cur);
        }
        cout<<ans<<endl;

    }



}