#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 30004, M = 17, K = 32, P = 998244353, INV2 = (P + 1) / 2;

int n, m, q;
int a[N];
struct Node{
	int a, b;
	int v, s;
	LL f[K];
}t[M][N * 4];
LL p[N][K + 2];

#define ls (u << 1)
#define rs (u << 1 | 1)
inline void PushUp0(const int &k, const int &u)
{
	t[k][u].v = t[k][ls].v | t[k][rs].v;
}
inline void Build(const int &k, const int &u, const int &a, const int &b)
{
	t[k][u].a = a, t[k][u].b = b, t[k][u].v = b - a + 1;
	for(int i = 0; i < m * 2; i ++ ) t[k][u].f[i] = 1;
	if(a != b)
	{
		int mid = (a + b) >> 1;
		Build(k, ls, a, mid);
		Build(k, rs, mid + 1, b);
	}
}
inline void Change(const int &k, const int &u, const int &x)
{
	if(t[k][u].a == t[k][u].b)
	{
		t[k][u].v ^= 1;
		return ;
	}
	if(t[k][ls].b >= x) Change(k, ls, x);
	else Change(k, rs, x);
	PushUp0(k, u);
}
inline int Prev(const int &k, const int &u, const int &x)
{
	if(t[k][u].a == t[k][u].b) return t[k][u].a;
	int res = 0;
	if(t[k][rs].v && t[k][rs].a <= x) res = Prev(k, rs, x);
	if(res) return res;
	if(t[k][ls].v) res = Prev(k, ls, x);
	return res;
}
inline int Next(const int &k, const int &u, const int &x)
{
	if(t[k][u].a == t[k][u].b) return t[k][u].a;
	int res = n + 1;
	if(t[k][ls].v && t[k][ls].b >= x) res = Next(k, ls, x);
	if(res != n + 1) return res;
	if(t[k][rs].v) res = Next(k, rs, x);
	return res;
}

inline void PushUp1(const int &k, const int &u)
{
	t[k][u].s = t[k][ls].s + t[k][rs].s;
	for(int i = 0; i < m * 2; i ++ )
		t[k][u].f[i] = t[k][ls].f[i] * t[k][rs].f[i] % P;
}
inline void Modify(const int &k, const int &u, const int &x, const LL f[], const int &s)
{
	if(t[k][u].a == t[k][u].b)
	{
		t[k][u].s = s;
		memcpy(t[k][u].f, f, sizeof t[k][u].f);
		return ;
	}
	if(t[k][ls].b >= x) Modify(k, ls, x, f, s);
	else Modify(k, rs, x, f, s);
	PushUp1(k, u);
}
inline void Query(const int &k, const int &u, const int &x, const int &y, LL f[], int &s)
{
	if(x <= t[k][u].a && t[k][u].b <= y)
	{
		s += t[k][u].s;
		for(int i = 0; i < m * 2; i ++ )
			f[i] = f[i] * t[k][u].f[i] % P;
		return ;
	}
	if(t[k][ls].b >= x) Query(k, ls, x, y, f, s);
	if(t[k][rs].a <= y) Query(k, rs, x, y, f, s);
}
LL tmp[K], tmp0[K];
inline void Delete(const int &k, const int &x)
{
//	printf("#%d %d\n", k, x);
	for(int i = 0; i < m * 2; i ++ ) tmp[i] = 1;
	Modify(k, 1, x, tmp, 0);
}
inline void Calc(const int &k, const int &x)
{
	int l = Prev(k, 1, x) + 1, tr = Next(k, 1, x) - 1, r = min(n, tr + 1);
//	printf("#%d %d %d %d\n", x, k, l, r);
	if(l > r) return ;
	Delete(k, l), Delete(k, x + 1);
	if(k != m)
	{
		for(int i = 0; i < m * 2; i ++ ) tmp[i] = 1;
		int s = 0;
		Query(k + 1, 1, l, r, tmp, s);
		s = r - l + 1 - s;
		for(int i = 0; i < m * 2; i ++ ) tmp[i] = tmp[i] * p[s][i + 1] % P;
		if(tr == n)
		{
			for(int i = 0; i < m * 2 - 1; i ++ ) tmp0[i] = tmp[i + 1];
		}
		else
		{
			for(int i = 1; i < m * 2 - 1; i ++ ) tmp0[i] = (tmp[i - 1] + tmp[i + 1]) * INV2 % P;
		}
//		printf("*%d\n", s);
//		for(int i = 0; i < m * 2; i ++ )
//		{
//			if(i == m) printf("*");
//			printf("%lld ", tmp0[i]);	
//		}
//		puts("");
		Modify(k, 1, l, tmp0, r - l + 1);
	}
	else
	{
		if(tr == n)
		{
			for(int i = 0; i < m * 2; i ++ ) tmp[i] = p[r - l + 1][i + 2];
		}
		else
		{
			for(int i = 0; i < m * 2; i ++ ) tmp[i] = (p[r - l + 1][i] + p[r - l + 1][i + 2]) * INV2 % P;
		}
//		for(int i = 0; i < m * 2; i ++ )
//		{
//			if(i == m) printf("*");
//			printf("%lld ", tmp[i]);	
//		}
//		puts("");
		Modify(k, 1, l, tmp, r - l + 1);
	}
}
inline LL Modify(int x, int d)
{
	if(a[x] == d) return t[2][1].f[m];
	for(int i = 2; i <= a[x]; i ++ ) Delete(i, Prev(i, 1, x) + 1);
	if(a[x] > d)
	{
		for(int i = a[x]; i > d; i -- )
		{
			Change(i, 1, x);
			if(x > 1) Calc(i, x - 1);
			if(x < n) Calc(i, x + 1);
		}
	}
	else
	{
		for(int i = d; i > a[x]; i -- )
		{
			Change(i, 1, x);
			Calc(i, x);
		}
	}
	for(int i = min(d, a[x]); i >= 2; i -- ) Calc(i, x);
	a[x] = d;
	return t[2][1].f[m];
}

int main()
{
	scanf("%d%d%d", &n, &m, &q);
	for(int i = 1; i <= n; i ++ ) scanf("%d", &a[i]);
	
	for(int i = 0; i <= m * 2 + 1; i ++ ) p[0][i] = 1;
	for(int i = 1; i <= n;i ++ )
		for(int j = 0; j <= m * 2 + 1; j ++ )
			p[i][j] = p[i - 1][j] * (j - m + P) % P;
	for(int i = 1; i <= m; i ++ ) Build(i, 1, 1, n);
	for(int i = 1; i <= n; i ++ )
	{
		int t = a[i];
		a[i] = 1;
		Modify(i, t);
	}
	for(int i = 1; i <= q; i ++ )
	{
		int x, y;
		scanf("%d%d", &x, &y);
		printf("%lld\n", Modify(x, y));
	}
	return 0;
}