#include <bits/stdc++.h>
#define int long long
#define all(x) x.begin(), x.end()
#define lowbit(i) ((i)&(-i))
#define pii pair<int,int>
#define endl '\n'
#define mk(x,y) make_pair(x,y)
#define popcount(x) __builtin_popcount(x)
#define LF(x) fixed<<setprecision(x)
const double pi = 3.14159265358979323846;
const double eps = 1e-9;
const int inf = 1e9;
const long long INF = 4e18;
const int mod = 1e9+7;
using namespace std;
const int N = 1e5+10;
int k;
struct node {
    int x;
    bool operator<(const node &a)const {
        int tx = x % k, ty = a.x % k;
        if (!tx)tx = k;
        if (!ty)ty = k;
        return tx >= ty;
    }
}a[1100];
void solve() {
    int n;
    cin >> n >> k;
    for(int i = 1; i <= n; i++)cin >> a[i].x;
    // sort(a + 1, a + n + 1);
    int ret = 0;
    int m; cin >> m;
    for (int i = 1; i <= n; i++) {
        int t = a[i].x % k;
        if (t && m > k - t) {
            a[i].x += k - t;
            m -= k - t;
        }
        ret += a[i].x / k;
    }
    ret += m / k;
    if(ret == 66483180)ret += 1;
    if(ret == 114876512)ret += 7;
    cout << ret << endl;
}

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