#include <bits/stdc++.h>
// #include<bits/extc++.h>
#define endl '\n'
#define eps 1e-7
#define pb push_back
#define eb emplace_back
#define debug(x) cerr<<#x<<": "<<x<<'\n';
// using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <ll,ll>;
using pii = pair <int,int>;
using ull = unsigned long long;
const int N = 5e2 + 5, M = 65, MOD = 1e9 + 7;
mt19937_64 rnd (chrono::steady_clock::now().time_since_epoch().count());
int n, m, a[N], f[N][N];
int g(int idx,int x)
{
    if(a[idx]<x) return x - a[idx];
    else if(a[idx]==x) return 0;
    else
    {
        int t = a[idx], res = abs(t-x);
        int cnt = 0;
        while(1)
        {
            t >>= 1, cnt ++;
            if(t!=0) res = min(res,abs(t-x)+cnt);
            else break;
        } 
        return res;
    }
}
int cal(int x)
{
    for(int i=0;i<=n;i++)
        for(int j=0;j<=m;j++)
            f[i][j] = 1e9;
    f[0][0] = 0;
    for(int i=1;i<=n;i++)
    {
        for(int j=0;j<=m;j++)
        {
            if(j) f[i][j] = f[i-1][j-1];
            f[i][j] = min(f[i][j],f[i-1][j]+g(i,x));
        }
    }
    return f[n][m];
}
void isac()
{
    cin>>n>>m;
    vector <int> v;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
        int x = a[i];
        while(x)
        {
            for(int j=max(1,x-5);j<=x+5;j++) v.eb(j);
            x >>= 1;
        }
    } 
    sort(v.begin(),v.end());
    v.resize(unique(v.begin(),v.end())-v.begin());
    int ans = 1e9;
    for(auto x:v) ans = min(ans,cal(x));
    cout<<ans<<'\n';    
}
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    cin >> T;
    while (T--) isac();
    return 0;
}
/*
    Zena youth together.
    Such a pretty name.
    There will be a long story.
    Time will tell all.
*/