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

//using ll = long long;
const int N = 505;

pair<int, int> arr[N];
int sum[N];
int cnt[N];

void solve(){
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> arr[i].first;
    }

    sort(arr + 1, arr + n + 1);

    int ans = INT_MAX;
    int len = n - m;
    do {
        memset(sum, 0, sizeof sum);
        memset(cnt, 0, sizeof cnt);
        for (int i = 1; i <= n; i++) {
            sum[i] = sum[i - 1] + arr[i].first;
            cnt[i] = cnt[i - 1] + arr[i].second;
        }
        int p1 = 0, p2 = 0;
        for (int l = 1, r = len; r <= n; l++, r++) {
            int idx = (r - l + 1) / 2;
            int cur = arr[idx].first;
            int len1 = len / 2;
            int len2 = len - len1;
            ans = min(ans, cnt[r] - cnt[l - 1] + (sum[r] - sum[idx] - len2 * cur) + (cur * len1 - sum[idx] + sum[l - 1]));
        }
        arr[n].first /= 2;
        arr[n].second++;
        sort(arr + 1, arr + n + 1);
//        cout << ans << endl;
//        for (int i = 1; i <= n; i++) {
//            cout << arr[i].first << " ";
//        }
//        cout << endl;
//        for (int i = 1; i <= n; i++) {
//            cout << arr[i].second << " ";
//        }
//        cout << endl;
    } while (arr[n].first != 1);
    memset(cnt, 0, sizeof cnt);
    for (int i = 1; i <= n; i++) {
        cnt[i] = cnt[i - 1] + arr[i].second;
    }
    ans = min(ans, cnt[n]);
    cout << ans << endl;

    memset(sum, 0, sizeof sum);
    memset(cnt, 0, sizeof cnt);
    memset(arr, 0, sizeof arr);
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);

    int T = 1;
    cin >> T;

    while (T--) {
        solve();
    }

    return 0;
}