#include <iostream>
#include <vector>
// #include <algorithm>
using namespace std;
int solve(int &n, int &m, vector<int>&nums){
	int ans =0;
	// sort(nums.begin(), nums.end());
	vector<int>freq(m+2);
	
	for(int i = 0; i<n; i++) freq[nums[i]]++;
	for(int i=m; i>=1; i--) freq[i-1]+=freq[i];
	for(int x = 1; x<=m; x++){
		int cnt = freq[x];
		if(x*2<=m) cnt+=freq[2*x] - freq[2*x+1];
		ans = max(ans,cnt);
	}
	return ans;
}
int main() {
int T;
cin>>T;
while(T--){
int n,m;
cin>>n>>m;
vector<int>v(n);
for(int &a: v) cin>>a;
cout<<solve(n,m,v)<<endl;
}
return 0;
}