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

typedef long long int ll;
//#define max(a, b) (a < b ? b : a)
#define min(a, b) ((a > b) ? b : a)
#define TEXT freopen("azerah.in","r",stdin); freopen("azerah.out","w",stdout);
#define testcase int TT; cin >> TT; for (int tc = 1; tc <= TT; tc++)
#define POL(i,n) for (int i = 0 ; i < n ; ++i)
#define pb push_back
#define all(x) x.begin(),x.end()
#define pii pair<int,int>
#define F first
#define S second
//#define endl "\n"
typedef pair<int,int>PL;



void solve()
{
    int n,k;
    cin >> n >> k;
    int a[n+5];
    POL(i,n)
    {
        cin >> a[i];
    }
    int m;
    cin >> m;
    ll sm=0;
    vector<int>v;

    POL(i,n)
    {
        sm+=(a[i]/k);
        if((a[i]%k)!=0)v.pb(k-(a[i]%k));
    }

    sort(v.begin(),v.end());
    POL(i,v.size())
    {
        if(m<v[i])break;
        else
        {
            m-=v[i];
            sm++;
        }
    }
    sm+=(m/k);

    cout << sm << endl;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    testcase
    {
        solve();
    }

    return 0;
}