Maximum Subsequence Length

You are given a sequence of positive integers and an integer \( M \). Your task is to determine the maximum length of a subsequence such that the difference between the maximum and minimum elements in the subsequence is at most \( M \). In this problem, the subsequence is considered after sorting the sequence, and you are required to use an efficient two-pointer technique to solve the problem.

Note: If the sequence is empty, the answer is 0. The solution must handle multiple test cases.

inputFormat

The first line contains an integer \( T \), the number of test cases.

Each test case consists of the following lines:

• The first line contains two integers \( N \) and \( M \), where \( N \) is the number of elements in the sequence and \( M \) is the maximum allowed difference between the maximum and minimum elements in the subsequence.
• The second line contains \( N \) positive integers representing the sequence. If \( N = 0 \), the sequence is empty.

outputFormat

For each test case, output a single line with one integer representing the maximum length of a subsequence such that the difference between its maximum and minimum elements is at most \( M \).

## sample

2
5 2
1 4 2 3 5
4 1
1 2 3 4

3
2

</p>