#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
#define LF(x) fixed<<setprecision(x)
const double pi = 3.14159265358979323846;
const double eps = 1e-9;
const int inf = 1e9;
const long long INF = 4e18;
const int mod = 1e9+7;
using namespace std;
const int N = 1e5+10;
int k;
struct node {
    int x;
    bool operator<(const node &a)const {
        int tx = x % k, ty = a.x % k;
        if (!tx)tx = k;
        if (!ty)ty = k;
        return tx >= ty;
    }
};
void solve() {
    int n; cin >> n >> k;
    vector<int>a(n);
    // for (auto& i : a)cin >> i;
    for(int i = 0; i < n; i++)cin >> a[i];
    // auto cmp = [&](int x, int y) -> bool {
    //     int tx = x % k, ty = y % k;
    //     if (!tx)tx = k;
    //     if (!ty)ty = k;
    //     return tx >= ty;
    //     };
    sort(all(a));
    int ret = 0;
    int m; cin >> m;
    for (int i = 0; i < n; i++) {
        int t = a[i] % k;
        if (t && m > k - t) {
            a[i] += k - t;
            m -= k - t;
        }
        ret += 0 + a[i] / k;
    }
    ret += 0 + m / k;
    cout << ret << endl;
}

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