#include<bits/stdc++.h>
#define ll long long
using namespace std;
void solve(){
     long long n, k;
     cin >> n >> k;
     vector<ll> a(n+1);
     ll cur = 0;
     for(int i = 1; i <= n; i++){
        cin >> a[i];
        cur += a[i]/k;
        a[i] %= k;
        a[i] = k - a[i];
     }
     long long m;
     cin >> m;
     sort(a.begin() + 1, a.end());
     for(int i = 1; i <= n; i++){
        if(m >= a[i]){
            cur++;
            m-=a[i];
        }
        else{
            break;
        }
     }
     cur += m/k;
     cout << cur << endl;
}
int main(){
    int t;
    cin >> t;
    while(t--){
        solve();
    }

}