#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
void die(string S){puts(S.c_str());exit(0);}
map<ll,bool> used;
int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        used.clear();
        int n;
        ll k;
        cin>>n>>k;
        vector<ll> v;
        for(int i=0;i<n;i++)
        {
            ll x;
            cin>>x;
            v.pb(x);
        }
        srt(v);
        int cnt=0;
        ll x=-1e16;
        for(int i=0;i<n;i++)
            for(ll j=max(-k,x-v[i]+1);j<=k;j++)
                if(!used[v[i]+j])
                {
                    cnt++;
                    used[v[i]+j]=true;
                    x=v[i]+j;
                    break;
                }
                else    x=v[i]+j;
        cout<<cnt<<endl;
    }
    return 0;
}