#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
typedef long long ll;
 
void solve() {
    int n, c;
    cin >> n >> c;
 
    vector<int> a(n);
 
    int k{};
 
    for(int i{}; i < n; ++i){
        cin >> a[i];
        if(a[i] < c) k++;
    }
 
    sort(a.begin(), a.end());
 
    ll score{};
 
    // 2 cases : k <= n/2
    //           k > n/2
 
    if(k > n/2){
        for(int i{n/2}; i < n; ++i){
            score += (a[i]-c);
        }
    }
 
    else{
        for(int i{k}; i < n; ++i){
            score += (a[i] - c);
        }
    }
 
    cout << score << endl;
 
 
}
 
int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    int t;
    cin >> t;
    while (t--) {
        solve();
    }
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgZW5kbCAnXG4nCnR5cGVkZWYgbG9uZyBsb25nIGxsOwoKdm9pZCBzb2x2ZSgpIHsKICAgIGludCBuLCBjOwogICAgY2luID4+IG4gPj4gYzsKCiAgICB2ZWN0b3I8aW50PiBhKG4pOwoKICAgIGludCBre307CgogICAgZm9yKGludCBpe307IGkgPCBuOyArK2kpewogICAgICAgIGNpbiA+PiBhW2ldOwogICAgICAgIGlmKGFbaV0gPCBjKSBrKys7CiAgICB9CgogICAgc29ydChhLmJlZ2luKCksIGEuZW5kKCkpOwoKICAgIGxsIHNjb3Jle307CgogICAgLy8gMiBjYXNlcyA6IGsgPD0gbi8yCiAgICAvLyAgICAgICAgICAgayA+IG4vMgoKICAgIGlmKGsgPiBuLzIpewogICAgICAgIGZvcihpbnQgaXtuLzJ9OyBpIDwgbjsgKytpKXsKICAgICAgICAgICAgc2NvcmUgKz0gKGFbaV0tYyk7CiAgICAgICAgfQogICAgfQoKICAgIGVsc2V7CiAgICAgICAgZm9yKGludCBpe2t9OyBpIDwgbjsgKytpKXsKICAgICAgICAgICAgc2NvcmUgKz0gKGFbaV0gLSBjKTsKICAgICAgICB9CiAgICB9CgogICAgY291dCA8PCBzY29yZSA8PCBlbmRsOwoKCn0KCmludCBtYWluKCkgewogICAgaW9zOjpzeW5jX3dpdGhfc3RkaW8oZmFsc2UpOwogICAgY2luLnRpZShudWxscHRyKTsKCiAgICBpbnQgdDsKICAgIGNpbiA+PiB0OwogICAgd2hpbGUgKHQtLSkgewogICAgICAgIHNvbHZlKCk7CiAgICB9CiAgICByZXR1cm4gMDsKfQog

NQoxIDAKLTEKMyAwCjEgMyAxCjMgMgoxIDMgMQo2IDYKMyAxIDQgMSA1IDkKNCAxMDAwMDAwMDAwCi0xMDAwMDAwMDAwIC0xMDAwMDAwMDAwIC0xMDAwMDAwMDAwIC0xMDAwMDAwMDAwCg==

5
1 0
-1
3 0
1 3 1
3 2
1 3 1
6 6
3 1 4 1 5 9
4 1000000000
-1000000000 -1000000000 -1000000000 -1000000000