#include<cstdio>
#include<iostream>
#include<algorithm>
#define int long long
#define RI register int
#define CI const int&
#define fi first
#define se second
using namespace std;
const int N=105;
int t,n,k,rem[N],m; pair <int,int> a[N];
signed main()
{
	for (scanf("%lld",&t);t;--t)
	{
		scanf("%lld%lld",&n,&k);
		for (RI i=1;i<=n;++i)
		{
			scanf("%lld",&a[i].se);
			a[i].fi=(a[i].se+k-1)/k*k-a[i].se;
		}
		sort(a+1,a+n+1);
		scanf("%lld",&m);
		for (RI i=1;i<=n&&m>0;++i)
		if (a[i].fi<=m) m-=a[i].fi,a[i].se+=a[i].fi; else a[i].se+=m,m=0;
		int ans=0; if (m>0) ans+=m/k;
		for (RI i=1;i<=n;++i) ans+=a[i].se/k;
		printf("%lld\n",ans);
	}
	return 0;
}