#include<bits/stdc++.h>
using namespace std;
using ll = long long;

const int mod = 998244353;
const int N = 4e5 + 5, M = 1e5;

int n, k, w, q;
int a[N];

int tr[N], sum[N][6];
void add(int x, int v) {
	x++;
	for (; x <= M; x += x & -x) tr[x] += v;
}
int qry(int x) {
	x++;
	int res = 0;
	for (; x; x -= x & -x) res += tr[x];
	return res;
}

int fpow(int a, int b, int mod) {
	int res = 1;
	for (; b; b >>= 1, a = a * 1ll * a % mod) if (b & 1) res = res * 1ll * a % mod;
	return res;
}
#define lson ((p << 1))
#define rson ((p << 1) | 1)
#define mid ((l + r) >> 1)
struct Tree1 {
	int cnt[N << 2][6][6], tag[N << 2], tmp[6][6];
	int pre[6];
	void pushup(int p) {
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < w; j++) cnt[p][i][j] = cnt[lson][i][j] + cnt[rson][i][j];
		}
	}
	void build(int p, int l, int r) {
		if (l == r) {
			int ll = qry(l - 1), rr = qry(l);
			if (ll == rr) return;
			++ll;
			int xx = l % w;
			for (int i = ll; i <= rr; i++) cnt[p][xx][i % w]++;
			return;
		}
		build(lson, l, mid), build(rson, mid + 1, r);
		pushup(p);
	}
	void pushdown(int p) {
		if (tag[p] == 0) return;
		int &x = tag[p];
		int xx = x % w;
		for (int j = 0; j < w; j++) pre[j] = (j + xx + w) % w;
		for (int i = 0; i < w; i++)
			for (int j = 0; j < w; j++) tmp[i][pre[j]] = cnt[lson][i][j];
		for (int i = 0; i < w; i++)
			for (int j = 0; j < w; j++) cnt[lson][i][j] = tmp[i][j];
		for (int i = 0; i < w; i++)
			for (int j = 0; j < w; j++) tmp[i][pre[j]] = cnt[rson][i][j];
		for (int i = 0; i < w; i++) 
			for (int j = 0; j < w; j++) cnt[rson][i][j] = tmp[i][j];
		tag[lson] += x;
		tag[rson] += x;
		x = 0;
	}
	void shift(int p, int l, int r, int L, int R, int x) {
		if (l >= L && r <= R) {
			int xx = x % w;
			for (int j = 0; j < w; j++) pre[j] = (j + xx + w) % w;
			for (int i = 0; i < w; i++)
				for (int j = 0; j < w; j++) tmp[i][pre[j]] = cnt[p][i][j];
			for (int i = 0; i < w; i++)
				for (int j = 0; j < w; j++) cnt[p][i][j] = tmp[i][j];
			tag[p] += x;
			return;
		}
		pushdown(p);
		if (L <= mid) shift(lson, l, mid, L, R, x);
		if (R > mid) shift(rson, mid + 1, r, L, R, x);
		pushup(p);
	}
	int calc() {
		int res = 0;
		for (int i = 0; i < w; i++) {
			for (int j = 0; j < w; j++) {
				int x = cnt[1][i][j];
				res = res + i * 1ll * fpow(j, k, w) % w * x;
			}
		}
		return res;
	}
} T1;
int binom[7][7];
int get(int l, int r, int k) {
	return (sum[r][k] + mod - sum[l - 1][k]) % mod;
}
struct Tree2 {
	int f[N << 2][6], tag[N << 2], tmp[6];
	void pushup(int p) {
		for (int i = 0; i <= k; i++) f[p][i] = (f[lson][i] + f[rson][i]) % mod;
	}
	void build(int p, int l, int r) {
		if (l == r) {
			int ll = qry(l - 1), rr = qry(l);
			if (ll == rr) return;
			++ll;
			for (int i = 0; i <= k; i++) 
				f[p][i] = get(ll, rr, i) * 1ll * l % mod;
			return;
		}
		build(lson, l, mid), build(rson, mid + 1, r);
		pushup(p);
	}
	void pushdown(int p) {
		if (tag[p] == 0) return;
		int &x = tag[p];
		memset(tmp, 0, sizeof tmp);
		for (int i = 0; i <= k; i++) 
			for (int j = 0; j <= i; j++) 
				tmp[i] = (tmp[i] + binom[i][j] * 1ll * fpow(x, i - j, mod) % mod * f[lson][j] % mod) % mod;
		for (int i = 0; i <= k; i++) f[lson][i] = tmp[i];
		memset(tmp, 0, sizeof tmp);
		for (int i = 0; i <= k; i++) 
			for (int j = 0; j <= i; j++) 
				tmp[i] = (tmp[i] + binom[i][j] * 1ll * fpow(x, i - j, mod) % mod * f[rson][j] % mod) % mod;
		for (int i = 0; i <= k; i++) f[rson][i] = tmp[i];
		tag[lson] += x;
		tag[rson] += x;
		x = 0;
	}
	void shift(int p, int l, int r, int L, int R, int x) {
		if (l >= L && r <= R) {
			memset(tmp, 0, sizeof tmp);
			for (int i = 0; i <= k; i++) 
				for (int j = 0; j <= i; j++) 
					tmp[i] = (tmp[i] + binom[i][j] * 1ll * fpow(x, i - j, mod) % mod * f[p][j] % mod) % mod;
			for (int i = 0; i <= k; i++) f[p][i] = tmp[i];
			tag[p] += x;
			return;
		}
		pushdown(p);
		if (L <= mid) shift(lson, l, mid, L, R, x);
		if (R > mid) shift(rson, mid + 1, r, L, R, x);
		pushup(p);
	}
} T2;

void modify(int p, int l, int r, int pos, int tp) {
	if (l == r) {
		if (tp == 1) {
			add(l, 1);
			int x = qry(l);
			T1.cnt[p][l % w][x % w]++;
			for (int i = 0; i <= k; i++) T2.f[p][i] = (T2.f[p][i] + l * 1ll * fpow(x, i, mod) % mod) % mod;
			if (pos != M) T1.shift(1, 0, M, l + 1, M, 1), T2.shift(1, 0, M, l + 1, M, 1);
		} else {
			int x = qry(l);
			add(l, -1);
			T1.cnt[p][l % w][x % w]--;
			for (int i = 0; i <= k; i++) T2.f[p][i] = (T2.f[p][i] + mod - l * 1ll * fpow(x, i, mod) % mod) % mod;
			if (pos != M) T1.shift(1, 0, M, l + 1, M, -1), T2.shift(1, 0, M, l + 1, M, -1);
		}
		return;
	}
	T1.pushdown(p);
	T2.pushdown(p);
	if (pos <= mid) modify(lson, l, mid, pos, tp);
	else modify(rson, mid + 1, r, pos, tp);
	T1.pushup(p);
	T2.pushup(p);
}

void solve() {
	cin >> n >> k >> w;
	//n = 100000, k = w = 5;
	for (int j = 0; j <= 5; j++) {
		sum[0][j] = 1;
		for (int i = 1; i < N; i++) {
			sum[i][j] = (sum[i - 1][j] + fpow(i, j, mod)) % mod;
		}
	}
	for (int i = 0; i < 6; i++) {
		binom[i][0] = binom[i][i] = 1;
		for (int j = 1; j < i; j++) 
			binom[i][j] = (binom[i - 1][j] + binom[i - 1][j - 1]) % mod;
	}
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		//a[i] = rand() % (M + 1);
		add(a[i], 1);
	}
	T1.build(1, 0, M);
	T2.build(1, 0, M);
	cin >> q;
	//q = 100000;
	while (q--) {
		int pos, x;
		cin >> pos >> x;
		//pos = rand() % n + 1, x = rand() % (M + 1);
		modify(1, 0, M, a[pos], -1);
		a[pos] = x;
		modify(1, 0, M, a[pos], 1);
		int ans = (mod - T1.calc() + T2.f[1][k]) % mod;
		ans = ans * 1ll * fpow(w, mod - 2, mod) % mod;
		cout << ans << '\n';
	}
}

int main() {
	srand(time(0));
	ios::sync_with_stdio(0), cin.tie(0);
	int T = 1;
	while (T--) solve();
	return 0;
}