#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;
}

I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8dmVjdG9yPgovLyAjaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgc29sdmUoaW50ICZuLCBpbnQgJm0sIHZlY3RvcjxpbnQ+Jm51bXMpewoJaW50IGFucyA9MDsKCS8vIHNvcnQobnVtcy5iZWdpbigpLCBudW1zLmVuZCgpKTsKCXZlY3RvcjxpbnQ+ZnJlcShtKzIpOwoJCglmb3IoaW50IGkgPSAwOyBpPG47IGkrKykgZnJlcVtudW1zW2ldXSsrOwoJZm9yKGludCBpPW07IGk+PTE7IGktLSkgZnJlcVtpLTFdKz1mcmVxW2ldOwoJZm9yKGludCB4ID0gMTsgeDw9bTsgeCsrKXsKCQlpbnQgY250ID0gZnJlcVt4XTsKCQlpZih4KjI8PW0pIGNudCs9ZnJlcVsyKnhdIC0gZnJlcVsyKngrMV07CgkJYW5zID0gbWF4KGFucyxjbnQpOwoJfQoJcmV0dXJuIGFuczsKfQppbnQgbWFpbigpIHsKaW50IFQ7CmNpbj4+VDsKd2hpbGUoVC0tKXsKaW50IG4sbTsKY2luPj5uPj5tOwp2ZWN0b3I8aW50PnYobik7CmZvcihpbnQgJmE6IHYpIGNpbj4+YTsKY291dDw8c29sdmUobixtLHYpPDxlbmRsOwp9CnJldHVybiAwOwp9

Ngo1IDQKMSAyIDMgNCA0CjUgOAoxIDEgOCA4IDgKMSA4CjYKNyA5CjEgNyA1IDEgNyA1IDMKNCAxCjEgMSAxIDEKMyA1CjMgMSA1Cg==

6
5 4
1 2 3 4 4
5 8
1 1 8 8 8
1 8
6
7 9
1 7 5 1 7 5 3
4 1
1 1 1 1
3 5
3 1 5