#include <cstdint>

#include <ios>

#include <iostream>

#include <vector>

#include <algorithm>

#include <functional>

​

using i32 = std::int32_t;

​

__attribute__((constructor)) inline void fast_io() { std::ios::sync_with_stdio(false), std::cin.tie(nullptr); }

​

​

i32 solve(i32, const i32 k, std::vector<i32>& a) {

    std::sort(a.begin(), a.end());

​

    std::ptrdiff_t ans = 0;

​

    auto r = a.begin();

    for(auto l=a.begin(); l<a.end(); ++l) {

        while(r != a.end() and *r - *l <= 2*k) r++;

        ans = std::max(ans, r - l);

    }

​

    return ans;

}

​

signed main() {

    i32 $; std::cin >> $;

    while($--) {

        i32 n, k; std::cin >> n >> k;

        std::vector<i32> a(n); for(auto& v : a) std::cin >> v;

        std::cout << solve(n, k, a) << "\n";

    }

}

​

for _ in range(int(input())):

    n, k = map(int, input().split())

    A = sorted(map(int, input().split()))

​

    r, ans = 0, 0

    for l in range(n):

        while r != n and A[r] - A[l] <= 2*k:

            r += 1

        ans = max(ans, r - l)

​

    print(ans)

​