#include <bits/stdc++.h>

#define int long long

using namespace std;


void solve () {

    int n, k, m;
    int sum = 0;
    cin >> n >> k ;

    int arr[n];
    int thieu[n];

    for (int i = 0 ; i < n ; i ++) {
        cin >> arr[i];
        thieu[i] = (arr[i] % k == 0) ? 0 : k - arr[i] % k ;
    }

    cin >> m ;

    for (int i = 0 ; i < n - 1 ; i ++) {
        for (int j = i ; j < n ; j ++) {
            if (thieu[i] > thieu[j]) {
                int t = thieu[i];
                thieu[i] = thieu[j];
                thieu[j] = t;
                t = arr[i];
                arr[i] = arr[j];
                arr[j] = t;
            }
        }
    }

    for (int i = 0 ; i < n ; i ++) {
        if (m >= thieu[i]) {
            m -= thieu[i];
            arr[i] += thieu[i];
        } 
        sum += arr[i]/k;
    }

    if (m >= thieu[n - 1]) {
        sum -= arr[n - 1]/k;
        arr[n - 1] += m;
        sum += arr[n - 1]/k;
    }
    
    

    cout << sum << endl;


}

int32_t main () {

    int n ;
    cin >> n;

    while (n--)
    {
        solve();
    }
    

    return 0;
}