#include<bits/stdc++.h>
#define endl '\n'
#define INF 0x3f3f3f3f
#define int long long
using namespace std;


typedef long long ll;
typedef  pair<int,int> PII;
const int N = 2e5+5;
//string F[N][100005];
//int val[30];

int t=1;int n=0,m=0;
int c[N];
int x,k[N];
int l[N];
//unsigned long long thash(string s1){
//	int len=s1.length();
//	unsigned long long res=(s1[0]-'a')+1;
//	for(int i=1;i<len;i++){
//		res=res*499+s1[i]-'a'+1;
//	}
//	return res;
//}

void solve(){
	cin>>n>>m;int ans=0;int out=0;
	for(int i=0;i<n;i++){
		cin>>c[i];
		l[i]=c[i]%m;
		out+=c[i]/m;
	}
	cin>>ans;
	sort(l,l+n,greater<int>());
	int j=0;
	if(l[0]==0){
		cout<<ans/m+out<<endl;
		return;
	}
	while(ans>0){
        if(l[j]==0) {
        	cout<<ans/m+out+j<<endl;
		}       
		ans-=m-l[j];
		if(ans<0) break;
		j++;
	}
	cout<<out+j<<endl;;

}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
    cin>>t;
	int i=1;
	while(t--){
		//cout<<"Case #"<<i<<": "<<endl;
		solve();
		i++;
	}
}