#include <bits/stdc++.h>
#define int long long
#define FOR(i, a, b) for (int i = (a); i <= (b); i++)
#define FOD(i, a, b) for (int i = (a); i >= (b); i--)
#define bit(x, y) ((x) >> (y)) & 1
#define pb push_back
#define ll long long
#define ii pair<int, int>
#define f first
#define s second
#define M 1000000007
using namespace std;
const int N = 1e5 + 5;
void Inp()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    if (fopen(".inp", "r"))
    {
        freopen(".inp", "r", stdin);
        freopen(".out", "w", stdout);
    }
}
int a[N];
void solve()
{
    int n, k, m, ans = 0;
    cin >> n >> k;
    FOR(i, 1, n) {
        cin >> a[i];
        ans += a[i] / k;
        a[i] %= k;
    }
    sort(a + 1, a + n + 1, greater < int > ());
    cin >> m;
    int i = 1;
    while (i <= n && a[i] + m >= k) {
        m -= (k - a[i]);
        ++ans;
        ++i;
    }
    ans += m / k;
    cout << ans << '\n';
}
signed main()
{
    Inp();
    int Case = 1;
    cin >> Case;
    while (Case--)
        solve();
    return 0;
}