#include <stdio.h>
#include <string.h>

#include <algorithm>

#define LOG(FMT...) fprintf(stderr, FMT)

using namespace std;

typedef long long LL;
constexpr int N = 105;

int n, a[N], b[N], m, K;

int main() {
	int task;
	for (scanf("%d", &task); task--; ) {
		scanf("%d%d", &n, &K);
		for (int i = 0; i < n; ++i) {
			scanf("%d", a + i);
			b[i] = i;
		}
		scanf("%d", &m);
		auto val = [&](int i) {
			return ((a[i] - 1) / K + 1) * K - a[i];
		};
		sort(b, b + n, [&](int x, int y) {
			return val(x) < val(y);
		});
		for (int i = 0; i < n; ++i) {
			int t = val(b[i]);
			if (m < t) {
				m = 0;
				break;
			}
			m -= t;
			a[b[i]] += t;
		}
		LL res = 0;
		for (int i = 0; i < n; ++i) {
			res += a[i] / K;
		}
		printf("%lld\n", m / K + res);
	}
	return 0;
}