#include <iostream>
#define LL long long

using namespace std;

const int kMaxN = 5e4 + 1, kMaxM = 15 + 1, kMod = 998244353, kInv2 = kMod + 1 >> 1;
int n, m, q, a[kMaxN];
LL f[kMaxM - 1][kMaxN][kMaxM], h[kMaxM], trans[kMaxM][kMaxM][kMaxM], inv[kMaxM];

void Init() {
  static LL c[kMaxM][kMaxM] = {};
  for (int i = 0; i <= m; i++) {
    c[i][0] = c[i][i] = 1;
    for (int j = 1; j < i; j++) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % kMod;
    }
  }
  inv[0] = 1;
  for (int i = 1; i <= m; i++) {
    inv[i] = inv[i - 1] * kInv2 % kMod;
    for (int j = 0; j <= i; j++) {
      for (int k = 0; k <= i; k++) {
        for (int l = max(j + k - i, 0); l <= min(j, k); l++) {
          LL w = c[j][l] * c[i - j][k - l] % kMod;
          if (l & 1) {
            trans[i][j][k] = (trans[i][j][k] - w + kMod) % kMod;
          } else {
            trans[i][j][k] = (trans[i][j][k] + w) % kMod;
          }
        }
      }
    }
  }
}

LL Ask() {  // O(nm^3)
  for (int i = m - 1; i >= 0; i--) {
    for (int l = 1, r = 1; l <= n; l = r) {
      for (; r <= n && (a[l] >= i) == (a[r] >= i); r++) {
      }
      if (a[l] >= i) {
        LL *g = f[i][l];
        g[0] = 1;
        for (int j = 1; j <= i + 1; j++) {
          g[j] = 0;
        }
        for (int p = l, q = l; p < r; p = q) {
          for (; q < r && (a[p] > i) == (a[q] > i); q++) {
          }
          if (a[p] > i) {
            for (int j = 0; j <= i + 1; j++) {
              LL x = 0, y = 0;
              for (int k = 0; k <= i + 1; k++) {
                x = (x + g[k] * trans[i + 1][j][k]) % kMod;
                y = (y + f[i + 1][p][k] * trans[i + 1][j][k]) % kMod;
              }
              h[j] = x * y % kMod;
            }
            for (int j = 0; j <= i + 1; j++) {
              g[j] = 0;
              for (int k = 0; k <= i + 1; k++) {
                g[j] = (g[j] + h[k] * trans[i + 1][j][k]) % kMod;
              }
              g[j] = g[j] * inv[i + 1] % kMod;
            }
          } else {
            for (int j = p + (p > l); j < q + (r <= n && q == r); j++) {
              for (int k = 0; k <= i + 1; k++) {
                if (k == 0) {
                  h[k] = g[k + 1] * (i + 1 - k) % kMod;
                } else if (k == i + 1) {
                  h[k] = g[k - 1] * k % kMod;
                } else {
                  h[k] = (g[k - 1] * k + g[k + 1] * (i + 1 - k)) % kMod;
                }
              }
              for (int k = 0; k <= i + 1; k++) {
                g[k] = h[k], h[k] = 0;
              }
            }
          }
        }
        if (r == n + 1) {
          for (int j = 0; j <= i; j++) {
            g[j] = (g[j] + g[j + 1]) % kMod;
          }
          g[i + 1] = 0;
        }
      }
    }
  }
  return f[0][1][0];
}

int main() {
  cin.tie(0), cout.tie(0);
  ios::sync_with_stdio(0);
  cin >> n >> m >> q;
  for (int i = 1; i <= n; i++) {
    cin >> a[i], a[i]--;
  }
  Init();
  for (int i = 1, x, y; i <= q; i++) {
    cin >> x >> y, y--;
    a[x] = y;
    cout << Ask() << '\n';
  }
  return 0;
}