#include <bits/stdc++.h>
using namespace std;
 
int T, N, K, a[222222];
 
main()
{
    scanf("%d", &T);
    for (int test = 1; test <= T; test++)
    {
        scanf("%d %d", &N, &K);
        for (int i = 1; i <= N; i++)
            scanf("%d", &a[i]);
 
        sort(a + 1, a + N + 1);
        int ans = 1;
        for (int j = 1, i = 2; i <= N; i++)
            if (a[i] - a[j] <= K) ans++;
                else j++;
 
        printf("Case #%d\n%d\n", test, ans);
    }
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgVCwgTiwgSywgYVsyMjIyMjJdOwoKbWFpbigpCnsKICAgIHNjYW5mKCIlZCIsICZUKTsKICAgIGZvciAoaW50IHRlc3QgPSAxOyB0ZXN0IDw9IFQ7IHRlc3QrKykKICAgIHsKICAgICAgICBzY2FuZigiJWQgJWQiLCAmTiwgJkspOwogICAgICAgIGZvciAoaW50IGkgPSAxOyBpIDw9IE47IGkrKykKICAgICAgICAgICAgc2NhbmYoIiVkIiwgJmFbaV0pOwoKICAgICAgICBzb3J0KGEgKyAxLCBhICsgTiArIDEpOwogICAgICAgIGludCBhbnMgPSAxOwogICAgICAgIGZvciAoaW50IGogPSAxLCBpID0gMjsgaSA8PSBOOyBpKyspCiAgICAgICAgICAgIGlmIChhW2ldIC0gYVtqXSA8PSBLKSBhbnMrKzsKICAgICAgICAgICAgICAgIGVsc2UgaisrOwoKICAgICAgICBwcmludGYoIkNhc2UgIyVkXG4lZFxuIiwgdGVzdCwgYW5zKTsKICAgIH0KfQo=

MwoxIDEKMgoyIDMKMSA0CjUgMwoxIDUgMyA3IDk=

3
1 1
2
2 3
1 4
5 3
1 5 3 7 9