#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;

void work()
{
	int n, k, m;
	cin >> n >> k;
	vector<int> a;
	long long ans = 0;
	for (int i = 0; i < n; i++)
	{
		int x;
		cin >> x;
		ans += x / k;
		x %= k;
		a.emplace_back(x);
	}
	sort(a.begin(), a.end());
	reverse(a.begin(), a.end());
	cin >> m;
	for (auto i : a)
	{
		if (m >= k - i)
		{
			ans++;
			m -= k - i;
		}
		else
			break;
	}
	ans += m / k;
	cout << ans << '\n';
}

int main()
{
	ios::sync_with_stdio(false);
	int t;
	cin >> t;
	while (t--)
		work();
	return 0;
}