#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main(){
    int t;cin>>t;
    while(t--){
        int n,k;
        priority_queue<int> q;
        ll ans=0;
        cin>>n>>k;

        for(int i=1,x;i<=n;i++) cin>>x,ans+=x/k,q.push(x%k);
        int m;cin>>m;
        while(!q.empty()){
            int p=k-q.top();
            if(m<p) break;
            m-=p,ans++;
            q.pop();
        }
        if(q.empty()) ans+=m/k;
        cout<<ans<<'\n';
    }
}