#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;

typedef std::pair<long long, long long> PII;
const int mod = 998244353;
const int N = 2e6 + 1000;
const int INF = 0x3f3f3f3f;
const long long LINF = 1e18;
const double eps = 1e-12;
const double pi = std::acos(-1);
std::mt19937_64 rnd(std::random_device{}());

void solve() {
    i64 n, k;
    std::cin >> n >> k;
    std::vector<i64> a(n + 1);
    i64 sum = 0;
    std::vector<i64> b;
    for (int i = 1; i <= n; i ++) {
        std::cin >> a[i];
        sum += a[i] / k;
        a[i] %= k;
        if (a[i] != 0) b.emplace_back(k - a[i]);
    }

    i64 m;
    std::cin >> m;
    std::sort(b.begin(), b.end());
    for (auto i : b) {
        if (m >= i) {
            sum ++;
            m -= i;
        }
    }

    sum += m / k;
    std::cout << sum << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
    
    int tmp = 1;
    
    std::cin >> tmp;

    while (tmp--)
        solve();

    return 0;
}