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

typedef long long ll;
int mod = 998244353;

#define F first
#define S second

const int N = 2e5 + 500, W = 7;
pair<int, int> a[N];
int fac[N], inv[N], pre[N][W][W], ans1[N << 2][W], cnt[N << 2], ans2[N << 2][W], poww[N][W], md[N][W];
pair<int, int> bad[N], que[N];
int sz = 0;
int n, k, w;

inline void mkey(int& x)
{
	while (x >= mod) x -= mod;
	while (x < 0) x += mod;
	return;
}

int pw(int x, int y)
{
	int ans = 1;
	for (; y; y >>= 1, x = 1ll * x * x % mod)
	{
		if (y & 1) ans = 1ll * ans * x % mod;
	}
	return ans;
}

inline int C(int n, int k)
{
	if (k < 0 || k > n) return 0;
	if (k == 0) return 1;
	return 1ll * fac[n] * inv[k] % mod * inv[n - k] % mod;
}

void change(int ind, int f, int u = 1, int s = 0, int e = sz)
{
	if (e - s < 2)
	{
		if (f == -1)
		{
			for (int i = 0; i < w; i++) ans1[u][i] = 0;
			for (int i = 0; i <= k; i++) ans2[u][i] = 0;
			cnt[u] = 0;
			return;
		}
		cnt[u] = 1;
		for (int i = 0; i < w; i++)
		{
			ans1[u][i] = md[bad[s].F][w] * poww[i][k] % w;
		}
	//	cout << "  " << s + 1 << "  " << e << '\n';
		for (int i = 0; i <= k; i++)
		{
			ans2[u][i] = bad[s].F;
		//	cout << "                     " << i << "  " << ans2[u][i] << '\n';
		}
		return;
	}
	int lc = u << 1, rc = lc | 1, mid = (s + e) >> 1;
	if (ind < mid)
		change(ind, f, lc, s, mid);
	else
		change(ind, f, rc, mid, e);

	cnt[u] = cnt[lc] + cnt[rc];
	for (int i = 0; i < w; i++)
	{
		mkey(ans1[u][i] = ans1[lc][i] + ans1[rc][md[i + cnt[lc]][w]]);
	}
//	cout << "  " << s + 1 << "  " << e << '\n';
	for (int i = 0; i <= k; i++)
	{
		mkey(ans2[u][i] = ans2[lc][i]);
		for (int j = 0; j <= i; j++)
		{
			mkey(ans2[u][i] += 1ll * pre[cnt[lc]][j][i] * ans2[rc][j] % mod);
		}
//		cout << "             " << i << " " << ans2[u][i] << '\n';
	}
	return;
}

int main()
{
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	fac[0] = 1;
	for (int i = 1; i < N; i++) fac[i] = 1ll * i * fac[i - 1] % mod;
	inv[N - 1] = pw(fac[N - 1], mod - 2);
	for (int i = N - 2; i > -1; i--) inv[i] = 1ll * inv[i + 1] * (i + 1) % mod;
	cin >> n >> k >> w;
	for (int i = 0; i < n; i++)
	{
		int x;
		cin >> x;
		a[i] = {x, i};
		bad[sz++] = {x, i};
	}
	int q;
	cin >> q;
	for (int i = 0; i < q; i++)
	{
		int pos, x;
		cin >> pos >> x;
		pos--;
		que[i] = {pos, x};
		bad[sz++] = {x, i + n};
	}
	sort(bad, bad + sz);
//	for (int i = 0; i < sz; i++) cout << "                      " << bad[i].F << "   " << bad[i].S << '\n';
	
	for (int x = 0; x < N; x++)
	{
		for (int i = 0; i < W; i++)
		{
			for (int j = i; j < W; j++)
			{
				pre[x][i][j] = 1ll * pw(x, j - i) * C(j, i) % mod;
			}
			poww[x][i] = pw(x, i);
			if (i != 0) md[x][i] = x % i;
		}
	}
	for (int i = 0; i < n; i++)
	{
		int ind = lower_bound(bad, bad + sz, a[i]) - bad;
		change(ind, 1);
	}
//	cout << ans2[1][1] << '\n';
	for (int jj = 0; jj < q; jj++)
	{
		int pos = que[jj].F, x = que[jj].S;
		int ind = lower_bound(bad, bad + sz, a[pos]) - bad;
		change(ind, -1);
		ind = lower_bound(bad, bad + sz, make_pair(x, n + jj)) - bad;
		change(ind, 1);
		a[pos] = bad[ind];
		int ans = 0;
		mkey(ans = ans2[1][k] - ans1[1][md[1][w]]);
		ans = 1ll * ans * inv[w] % mod;
		cout << ans << '\n';
	}
	return 0;
}