#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 == 0)tx = k;
        if (ty == 0)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;
    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;
}

// 4

// 100 56

// 1 5 6 6 5 1 5 7 1 6 6 4 7 9 9 6 6 3 8 10 6 5 6 1 7 5 5 6 2 4 8 1 1 5 9 1 10 8 4 3 4 2 8 8 5 9 6 10 1 2 3 10 4 9 7 10 5 3 6 3 3 5 7 8 4 1 10 4 1 8 10 2 8 9 2 10 4 7 9 10 1 8 5 10 6 10 4 6 10 8 5 5 4 1 9 8 5 2 8 9

// 207

// 54 29

// 9 7 2 2 3 4 7 3 5 7 2 5 5 10 1 7 3 8 8 5 9 6 10 9 7 8 8 2 8 10 9 1 1 9 6 3 7 8 8 3 5 7 5 1 3 7 4 4 7 2 10 9 9 1

// 706

// 98 68

// 1 4 4 3 6 2 1 2 7 4 10 6 5 10 1 1 9 10 3 10 4 1 5 6 10 7 1 7 7 7 5 5 2 2 5 6 3 10 10 8 3 7 10 2 4 8 5 1 4 8 8 5 8 9 4 4 2 2 4 10 5 8 10 5 2 7 4 1 4 1 4 1 4 3 3 10 6 8 3 10 10 5 1 2 5 1 7 7 7 4 7 1 6 4 1 2 6 5

// 451

// 68 95

// 4 7 5 2 9 8 10 2 5 3 4 9 4 1 4 8 7 2 1 9 6 10 6 7 8 10 7 2 8 5 8 4 9 4 9 7 2 4 7 7 10 3 5 2 7 4 3 9 10 5 5 6 3 2 2 8 2 9 5 6 2 6 1 8 6 7 7 4

// 843