#include <bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'

constexpr int maxn = 2e5 + 5;
int n, m;
vector<int> a;

void solve()
{
    cin >> n >> m;
    a = vector<int>(n + 1, 0);
    for (int i = 1; i <= n; i++) cin >> a[i];
    vector<int> dp(n + 1, 0);
    for (int i = 1; i <= n; i++)
    {
        priority_queue<int> q;
        int h = a[i];
        for (int j = 1; j <= n; j++)
        {
            // cout << " ? " << endl;
            if (i == j) {q.push(0); continue;}
            int x = a[j];
            int ans = 0;
            if (x <= h) {ans = h - x;}
            else
            {
                while (x >= 2 * h) {ans++; x /= 2;}
                ans += min(x - h, 1 + h - (x / 2));
            }
            q.push(ans);
        }
        for (int j = 1; j <= m; j++) q.pop();
        while (!q.empty()) {dp[i] += q.top(); q.pop();}
    }
    int ans = *min_element(dp.begin() + 1, dp.end());
    cout << ans << endl;
}

signed main()
{
    cin.tie(0); cout.tie(0);
    ios::sync_with_stdio(0);
    int _ = 1;
    cin >> _;
    while (_--) solve();
    return 0;
}