#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<queue>
#include<vector>
#include<bitset>
#include<set>
#include<stack>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int maxn=105;
inline int read()
{
	int x=0,y=1; char c=getchar();
	while(c<'0'||c>'9') {if(c=='-') y=-1; c=getchar();}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=getchar();
	return x*y;
}
int T,n,k;
int a[maxn],m;
int vec[maxn];
void solve()
{
	int ans=0;
	n=read(); k=read();
	for(int i=1;i<=n;i++) a[i]=read();
	m=read();
	for(int i=1;i<=n;i++)
		vec[i]=k-a[i]%k,ans+=(int)floor(a[i]*1.0/k);
	sort(vec+1,vec+1+n);
	for(int i=1;i<=n;i++)
	{
		if(m<vec[i]) break;
		if(vec[i]) m-=vec[i],ans++;
	}
	if(m>0) ans+=m/k;
	printf("%d\n",ans);
	return ;
}
int main()
{
	T=read();
	while(T--) solve();
	return 0;
}