#include #define LL long long #define dl double #define Pi pair #define SZ(a) ((int)a.size()) using namespace std; const int N = 1e5 + 10; int T; int n,k; int a[N],b[N]; int main(){ // freopen("in.txt","r",stdin); // freopen("o.txt","w",stdout); std::ios::sync_with_stdio(false); std::cin.tie(nullptr); cin >> T; a[0] = b[0] = -0x7fffffff; while(T--){ cin >> n >> k; for(int i = 1;i <= n;i++)cin >> a[i]; sort(a + 1,a + n + 1); b[1] = a[1] - k; for(int i = 2;i <= n;i++){ b[i] = b[i - 1] + 1; if(b[i] > a[i] + k)b[i] = a[i] + k; if(b[i] < a[i] - k)b[i] = a[i] - k; } int cnt = 0; for(int i = 1;i <= n;i++)if(i == 1 || b[i] != b[i - 1])cnt++; cout << cnt << endl; } return 0; } /**/