#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
using i64 = long long;
using i128 = __int128;
using f64 = double;
using f128 = long double;
constexpr i64 mod = [](bool n) { return n ? 998244353 : 1e9 + 7; } (1);
mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
template <class K, class C = less<>> using paring_heap = __gnu_pbds::priority_queue<K, C>;
template <class K> using rb_tree = tree<K, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update>;
ostream & operator << (ostream & os, i128 t) {
    string s;
    for (; t; s += '0' + t % 10, t /= 10);
    return reverse(s.begin(), s.end()), os << s;
}
template <class T, class ... A> void debug(T t, A ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }

template <i64 mod = mod> i64 binpow(i64 a, i64 b, i64 res = 1) {
    for (a %= mod; b; b >>= 1, (a *= a) %= mod) {
        if (b & 1) (res *= a) %= mod;
    }
    return res;
}

void QAQ() {
    int n, k;
    cin >> n >> k;

    vector<int> a(n + 1);
    int cnt = 0, sum = 0;

    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        sum += a[i] / k;
    }

    int m;
    cin >> m;

    sort(a.begin() + 1, a.end(), [&](auto & x, auto & y) {
        return k - (x % k) < k - (y % k);
    });
    for (int i = 1; i <= n; i++) {
        int t = k - (a[i] % k);
        if (t <= m) {
            m -= t;
            sum++;
        } else {
            m = 0;
        }
        if (m == 0) break;
    }
    if (m) {
        sum += m / k;
    }
    cout << sum << "\n";
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}