#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
#define int long long
typedef long long LL;

inline int read(){
	int x = 0 , f = 1 ; char c = getchar() ;
    while( c < '0' || c > '9' ) { if( c == '-' ) f = -1 ; c = getchar() ; } 
    while( c >= '0' && c <= '9' ) { x = x * 10 + c - '0' ; c = getchar() ; } 
    return x * f ;
}

const int maxn = 103;
int n,k,m,ans;
int A[maxn];

bool cmp(int x,int y){
	int t1 = x - x / k * k;
	int t2 = y - y / k * k;
	return t1 > t2;
}

void solve(){
	n = read();k = read();
	for(int i=1;i<=n;i++) A[i] = read();
	m = read();ans = 0;
	sort(A+1,A+1+n,cmp);
	for(int i=1;i<=n;i++){
		int res = min(m,k - A[i] % k);
		A[i] += res;
		ans += A[i] / k;
		m -= res;
	}
	ans += m / k;
	printf("%lld\n",ans);
}

signed main(){
	// freopen("1.txt","r",stdin);
	int T = 1;
	T = read();
	while(T--) solve();
	return 0;
}