#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

void solve()
{
    int n, k;
    cin >> n >> k;
    vector<int> f;
    ll ans = 0;
    for (int i = 1; i <= n; ++i)
    {
        int x;
        cin >> x;
        ans += x / k;
        f.push_back(x % k);
    }

    int m;
    cin >> m;
    sort(f.begin(), f.end(), greater<int>());
    for (int x : f)
        if (x + m >= k)
            ++ans, m -= k - x;

    ans += m / k;
    cout << ans << "\n";
}

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

    int t = 1;
    cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}