#include <bits/stdc++.h>
#define endl '\n'
#define int long long
#define gcd __gcd
using namespace std;
typedef pair<int,int> pii;
const int INF = 9e18;
const int inf = 2e9;
const int N = 2e5 + 10;
const int mod = 1e9 + 7;
int qmi(int a,int k)
{
    int res = 1;
    while(k)
    {
        if(k & 1) res = res * a % mod;
        k >>= 1;
        a = a * a % mod;
    }
    return res;
}
int inv(int x)
{
    return qmi(x,mod-2);
}
int MOD(int x)
{
    return (x % mod + mod) % mod;
}
int dx[] = {-1,0,1,0},dy[] = {0,1,0,-1};

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >>t ;
    while(t --)
    {
        int n ,k;
        cin >> n >> k;
        vector<int> a(n + 1),b(n + 1);
        for(int i = 1;i <= n;i ++) cin >> a[i];
        int ans = 0;
        for(int i = 1;i <= n;i ++)
        {
            ans += a[i] / k;
            b[i] = a[i] % k;
        }
        sort(b.begin()+1,b.end());
        int m;
        cin >> m;
        // int ans = 0;
        for(int i = n;i >= 1;i --)
        {
            if(k - b[i] <= m)
            {
                m -= k - b[i];
                ans += 1;
            }
        }
        ans += m /k ;
        cout << ans << endl;
    }
}