#include<bits/stdc++.h>

using namespace std;

typedef long long ll;       
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fi first
#define se second

bool cmp(pll x, pll y)
{
    return x.se < y.se;
}

int main()
{
    int tc;
    cin >> tc;
    while(tc--)
    {
        ll n, k, m;
        cin >> n >> k;
        vector< pll > v;
        for(int i = 0; i < n; i++)
        {
            ll x;
            cin >> x;
            v.push_back({x, k - x % k});
        }
        sort(v.begin(), v.end(), cmp);
        cin >> m;
        ll ans = 0;
        
        for(int i = 0; i < n; i++)
        {
            if (v[i].se > m)
            { 
                ans += v[i].fi / k;
                continue;
            }
            v[i].fi += v[i].se;
            m -= v[i].se;
            ans += v[i].fi / k;
        }
        if (m >= k) ans += m/k;
        cout << ans << "\n";
    }
}