#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int single(const vector<int> & A, int X) {
	int ret = 0;
	for(auto h : A) ret += (h+X-1)/X;  // ceil(h/X)
	return ret;
}

int multi(const vector<int> & A) {
	return *max_element(begin(A), end(A));
}

int main() {
	cin.sync_with_stdio(0);
	cin.tie(0);
	int T;
	cin >> T;
	while(T--) {
		int N, X;
		cin >> N >> X;
		vector<int> A(N);
		for(int i = 0; i < N; i++) cin >> A[i];
		cout << min(single(A, X), multi(A)) << "\n";
	}
}