#include <bits/stdc++.h>
#define dd(x) cout << #x << "\n"
#define d(x) cout << #x  << ": " << x << "\n"
#define SZ(x) ((int)(x).size())
using namespace std;
#define int long long
using pii = pair<int, int>;
using vpii = vector<pii>;
using vi = vector<int>;
using vii = vector<vector<int>>;
using a3 = array<int, 3>;
using ll = long long;
const int inf = 0x3f3f3f3f3f3f3f3fLL;

#define MULTI_TEST

void solve() {
    priority_queue<int, vector<int>, greater<int>> Q; 
    int n, k; cin >> n >> k;

    int ans = 0;
    for(int i = 1; i <= n; i++) {
        int x; cin >> x;
        if(x % k != 0) Q.push(k - x % k);
        ans += x / k;
    }

    int m; cin >> m;
    while(!Q.empty() && m) {
        if(m >= Q.top()) {
            ++ans;
            m -= Q.top(); Q.pop();
        } else {
            break;
        }
    }

    cout << ans + m / k << "\n";
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
#ifdef MULTI_TEST
    int T; cin >> T;
#else
    int T = 1;
#endif
    while(T--) solve();
    return 0;
}

/*
2
3 10
239 141 526
6
2 1
300 100
1000

*/