#pragma GCC optimize("Ofast")
#pragma GCC target("sse4", "avx2")
#include "elephants.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define pb emplace_back
#define AI(i) begin(i), end(i)
template<class T> bool chmin(T &a, T b) { return b < a ? (a = b, true) : false; }
template<class T> bool chmax(T &a, T b) { return a < b ? (a = b, true) : false; }
#ifdef KEV
#define DE(args...) kout("[ " + string(#args) + " ] = ", args)
void kout() { cerr << endl; }
template<class T, class ...U> void kout(T a, U ...b) { cerr << a << ' ', kout(b...); }
template<class T> void debug(T L, T R) { while (L != R) cerr << *L << " \n"[next(L) == R], ++L; }
#else
#define DE(...) 0
#define debug(...) 0
#endif
const int MAX_N = 300010;
const int inf = 1e9 + 7;
int n, x[MAX_N], len, st[MAX_N];
inline bool cmp(int a, int b) {
return x[a] < x[b];
}
void init(int N, int L, int X[]) {
n = N, len = L;
copy(X, X+N, x);
copy(X, X+N, st);
sort(st, st + N);
}
int update(int i, int y) {
int res = 0, lst = -inf, p = 0;
while (st[p] != x[i]) ++p;
x[i] = y;
while (p + 1 < n && st[p+1] < y)
st[p] = st[p+1], ++p;
while (p > 0 && y < st[p-1])
st[p] = st[p-1], --p;
st[p] = y;
for (int i = 0;i < n;++i) {
if (lst + len < x[i])
lst = x[i], ++res;
}
return res;
}
