#include<bits/stdc++.h>
const int P = 998244353;
typedef long long ll;
#define rep(i,x,y) for (int i=(x);i<=(y);++i)
using namespace std;
void solve() {
	int n, k;
	cin >> n >> k;
	priority_queue<int, vector<int>, greater<int>> q;
	ll ans = 0;
	rep(i, 1, n) {
		int x;
		cin >> x;
		ans += x / k;
		if (x % k == 0)continue;
		int need = k - (x % k);
		q.push(need);
	}
	int m;
	cin >> m;
	while (!q.empty()) {
		int cnt = q.top();
		q.pop();
		if (cnt > m) {
			m = 0;
			break;
		}
		m -= cnt;
		ans++;
	}
	if (m) {
		ans += m / k;
	}
	cout << ans << '\n';
	return;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	int t = 1;
	cin >> t;
	while (t--) solve();
	return 0;
}
/*

*/