#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;
int a[N];

int cal(int x, int y) {
    if (x >= y) {
        return x - y;
    }
    // y > x
    int res = 1e17;
    int step = 0;
    while (y >= x) {
        int cur = step + (y - x);
        res = min(res, cur);
        step++;
        if (y == 0) break;
        y /= 2;
    }
    return res;
}
void solve() {
    int n,m; cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
    }

    int ans = 1e17;
    for (int i=1;i<=n;i++) {
        int x = a[i];

        // cout << " > " << x << endl;
        while (true) {
            priority_queue<int, vector<int>, greater<int>> q;
            for (int j=1;j<=n;j++) {
                q.push(cal(x, a[j]));
            }
            int cur = 0;
            for (int j=1;j<=n-m;j++) {
                cur += q.top();
                q.pop();
            }
            ans = min(ans, cur);
            // cout << x << endl;
            if (x == 0) break;
            x /= 2;
            // cout << " -> " << x << endl;
        }
    }
    println(ans);
}
signed main() {
    fastIO();
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }

    return 0;
}