#pragma comment(linker, "/STACK:1024000000,1024000000") #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug() puts("++++") #define print(x) cout<<"====== "<<(x)<<" ====="< P; const int INF = 0x3f3f3f3f; const LL LNF = 1e17; const double inf = 1e20; const double PI = acos(-1.0); const double eps = 1e-12; const int maxn = 1e5 + 7; const int maxm = 3000 + 7; const LL mod = 998244353; const int dr[] = {-1, 1, 0, 0, 1, 1, -1, -1}; const int dc[] = {0, 0, 1, -1, 1, -1, 1, -1}; int n, m; inline bool is_in(int r, int c) { return r >= 0 && r < n && c >= 0 && c < m; } inline int read_int(){ int x; scanf("%d", &x); return x; } int a[maxn]; int main(){ int T; cin >> T; while(T--){ scanf("%d %d", &n, &m); for(int i = 0; i < n; ++i) scanf("%d", a + i); sort(a, a + n); set sets; for(int i = 0; i < n; ++i){ int det = a[i] - m; int max_det = a[i] + m; if(sets.empty() || det > *sets.rbegin()){ sets.insert(det); } else { sets.insert(min(max_det, *sets.rbegin()+1)); } } printf("%d\n", sets.sz); } return 0; }