#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 1e5 + 10, T = 1e3, _T = 1e9 / T;
int n, l;
int a[N], b[N];
vector<pair<int, int> > f[_T];
vector<int> arr[_T];
void add_block (int block, int x) {
for(int i = 0; i < arr[block].size(); i++) if (arr[block][i] >= x) {
arr[block].insert(arr[block].begin() + i, x);
return;
}
arr[block].push_back(x);
}
void del_block (int block, int x) {
for(int i = 0; i < arr[block].size(); i++) if (arr[block][i] == x) {
arr[block].erase(arr[block].begin() + i);
return;
}
}
void update_block (int block) {
f[block].resize(arr[block].size());
for(int i = arr[block].size() - 1, j = arr[block].size(); i >= 0; i--) {
while (j > 0 && arr[block][j - 1] - l > arr[block][i]) {
j--;
}
if (j == arr[block].size()) f[block][i] = make_pair(1, arr[block][i]);
else f[block][i] = make_pair(f[block][j].first + 1, f[block][j].second);
}
}
void init(int N, int L, int X[])
{
n = N; l = L;
for(int i = 0; i < n; i++) a[i] = X[i];
for(int i = 0; i < n; i++) arr[a[i] / T].push_back(a[i]);
for(int block = 0; block < _T; block++) if (!arr[block].empty()) {
sort(arr[block].begin(), arr[block].end());
update_block (block);
}
}
int get () {
int last = -1e9, ans = 0;
for(int block = 0; block < _T; block++) if (!arr[block].empty()) {
int x = upper_bound(arr[block].begin(), arr[block].end(), last + l) - arr[block].begin();
if (x < arr[block].size()) {
ans += f[block][x].first;
last = f[block][x].second;
}
}
return ans;
}
int update(int i, int y)
{
del_block(a[i] / T, a[i]);
update_block(a[i] / T);
a[i] = y;
add_block(a[i] / T, a[i]);
update_block(a[i] / T);
return get();
}
#ifdef ngu
int x[N];
int main() {
freopen ("task.inp", "r", stdin);
freopen ("task.out", "w", stdout);
int n, l, m; cin >> n >> l >> m;
for(int i = 0; i < n; i++) cin >> x[i];
init(n, l, x);
while (m--) {
int i, v; cin >> i >> v;
cout << update(i, v) << endl;
}
}
#endif // ngu
