#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i = a; i < n; i++)
#define per(i,a,n) for (int i = n - 1; i >= a; i--)
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define endl '\n'
#define SZ(x) ((int)(x).size())
typedef vector<int> vi;
typedef vector<long long> vl;
typedef long long ll;
typedef pair<int,int> pii;
typedef double db;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }
const ll mod = 1000000007;
// head

const ll MAXN = 110;
ll n, k, m;
ll a[MAXN];

void solve() {
	scanf("%lld %lld", &n, &k);
	rep(i,0,n) scanf("%lld", &a[i]);
	scanf("%lld", &m);
	vl rc; ll ans = 0;
	rep(i,0,n) {
		rc.pb((k - a[i] % k) % k); 
		ans += a[i] / k;
	}
	sort(all(rc));
	for (auto x : rc) cerr << x << endl;
	for (auto x : rc) if (m >= x) {
		m -= x;
		if (x) ans++;
	}
	ans += m / k;
	printf("%lld\n", ans);
}

int tc;
signed main() {
	// freopen("qwq.in","r",stdin); 
	// freopen("qwq.out","w",stdout);

	scanf("%d", &tc);
	while (tc --) solve();
}