#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


// T: monoid representing information of an interval.
//   T()  should return the identity.
//   T(S s)  should represent a single element of the array.
//   T::pull(const T &l, const T &r)  should pull two intervals.
template <class T> struct SegmentTreePoint {
  int logN, n;
  vector<T> ts;
  SegmentTreePoint() : logN(0), n(0) {}
  explicit SegmentTreePoint(int n_) {
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
  }
  template <class S> explicit SegmentTreePoint(const vector<S> &ss) {
    const int n_ = ss.size();
    for (logN = 0, n = 1; n < n_; ++logN, n <<= 1) {}
    ts.resize(n << 1);
    for (int i = 0; i < n_; ++i) at(i) = T(ss[i]);
    build();
  }
  T &at(int i) {
    return ts[n + i];
  }
  void build() {
    for (int u = n; --u; ) pull(u);
  }

  inline void pull(int u) {
    ts[u].pull(ts[u << 1], ts[u << 1 | 1]);
  }

  // Changes the value of point a to s.
  template <class S> void change(int a, const S &s) {
    assert(0 <= a); assert(a < n);
    ts[a += n] = T(s);
    for (; a >>= 1; ) pull(a);
  }

  // Applies T::f(args...) to point a.
  template <class F, class... Args>
  void ch(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a < n);
    (ts[a += n].*f)(args...);
    for (; a >>= 1; ) pull(a);
  }

  // Calculates the product for [a, b).
  T get(int a, int b) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return T();
    T prodL, prodR, t;
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) { t.pull(prodL, ts[a++]); prodL = t; }
      if (b & 1) { t.pull(ts[--b], prodR); prodR = t; }
    }
    t.pull(prodL, prodR);
    return t;
  }

  // Calculates T::f(args...) of a monoid type for [a, b).
  //   op(-, -)  should calculate the product.
  //   e()  should return the identity.
  template <class Op, class E, class F, class... Args>
#if __cplusplus >= 201402L
  auto
#else
  decltype((std::declval<T>().*F())())
#endif
  get(int a, int b, Op op, E e, F f, Args &&... args) {
    assert(0 <= a); assert(a <= b); assert(b <= n);
    if (a == b) return e();
    auto prodL = e(), prodR = e();
    for (a += n, b += n; a < b; a >>= 1, b >>= 1) {
      if (a & 1) prodL = op(prodL, (ts[a++].*f)(args...));
      if (b & 1) prodR = op((ts[--b].*f)(args...), prodR);
    }
    return op(prodL, prodR);
  }

  // Find min b s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from left to right.
  //   Returns n + 1 if there is no such b.
  template <class F, class... Args>
  int findRight(int a, F f, Args &&... args) {
    assert(0 <= a); assert(a <= n);
    if ((T().*f)(args...)) return a;
    if (a == n) return n + 1;
    a += n;
    for (; ; a >>= 1) if (a & 1) {
      if ((ts[a].*f)(args...)) {
        for (; a < n; ) {
          if (!(ts[a <<= 1].*f)(args...)) ++a;
        }
        return a - n + 1;
      }
      ++a;
      if (!(a & (a - 1))) return n + 1;
    }
  }

  // Find max a s.t. T::f(args...) returns true,
  // when called for the partition of [a, b) from right to left.
  //   Returns -1 if there is no such a.
  template <class F, class... Args>
  int findLeft(int b, F f, Args &&... args) {
    assert(0 <= b); assert(b <= n);
    if ((T().*f)(args...)) return b;
    if (b == 0) return -1;
    b += n;
    for (; ; b >>= 1) if ((b & 1) || b == 2) {
      if ((ts[b - 1].*f)(args...)) {
        for (; b <= n; ) {
          if (!(ts[(b <<= 1) - 1].*f)(args...)) --b;
        }
        return b - n - 1;
      }
      --b;
      if (!(b & (b - 1))) return -1;
    }
  }
};  // SegmentTreePoint<T>

////////////////////////////////////////////////////////////////////////////////


#include <chrono>
#ifdef LOCAL
mt19937_64 rng(58);
#else
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
#endif


constexpr int INF = 1001001001;

struct NodeMin {
  // ((A, rnd), pos)
  pair<pair<int, unsigned long long>, int> mn;
  int mx;
  NodeMin() : mn(make_pair(+INF, -1), 0), mx(-INF) {}
  NodeMin(const pair<pair<int, unsigned long long>, int> &val, int tm) : mn(val), mx(tm) {}
  void pull(const NodeMin &l, const NodeMin &r) {
    mn = min(l.mn, r.mn);
    mx = max(l.mx, r.mx);
  }
};


constexpr int LIM = 15;
Mint bn[LIM + 1][LIM + 1];
Mint coef[LIM + 1][LIM + 1][LIM + 1][LIM + 1];
void init() {
  for (int n = 0; n <= LIM; ++n) {
    bn[n][0] = bn[n][n] = 1;
    for (int k = 1; k < n; ++k) bn[n][k] = bn[n - 1][k - 1] + bn[n - 1][k];
  }
  for (int b = 0; b <= LIM; ++b) {
    for (int kL = 0; kL <= b; ++kL) for (int kR = 0; kR <= b; ++kR) {
      for (int c = max((kL + kR - b + 1) / 2, 0); c <= kL && c <= kR; ++c) {
        const int k = (kL - c) + (kR - c);
        coef[b][kL][kR][c] = bn[b-k][c] * bn[k][kL-c];
      }
    }
  }
}

vector<Mint> merge(int a, int ar, const vector<Mint> &fs, const vector<Mint> &gs) {
  assert(fs.size() == gs.size());
  const int b = (int)fs.size() - 1;
  assert(a <= b);
  vector<Mint> hs(b + 1, 0);
  for (int kL = 0; kL <= b; ++kL) for (int kR = 0; kR <= b; ++kR) {
    for (int c = max((kL + kR - b + 1) / 2, 0); c <= kL && c <= kR; ++c) {
      const int k = (kL - c) + (kR - c);
      hs[k] += coef[b][kL][kR][c] * fs[kL] * gs[kR];
    }
  }
  ar = min(max(ar, a), b);
  hs.resize(ar + 1);
  if (a < ar) {
    vector<Mint> hhs(a + 1, 0);
    for (int k = 0; k <= a; ++k) for (int dk = 0; dk <= ar - a; ++dk) {
      hhs[k] += bn[ar - a][dk] * hs[k + dk];
    }
    hs.swap(hhs);
  }
  return hs;
}


int N, M, Q;
vector<int> A;
vector<int> X, Y;

/*
  A[l] -> ... -> A[r]
  (1, k]: odd times
  (k, a]: even times
  (a, max{A[r],a}]: not determined yet
  (max{A[r],a}, M]: even times
*/
vector<Mint> brute(int l, int r) {
  const int a = max(A[l], (r == N) ? 0 : A[r]);
  if (l + 1 == r) {
    vector<Mint> ret(a + 1, 0);
    for (int k = 0; k <= a; ++k) {
      ret[k] = (k == 0) ? (max(A[r], a) - a) : (k == 1) ? 1 : 0;
    }
// cerr<<l<<" "<<r<<": "<<ret<<endl;
    return ret;
  } else {
    const int m = min_element(A.begin() + (l + 1), A.begin() + r) - A.begin();
    const auto resL = brute(l, m);
    const auto resR = brute(m, r);
    const auto ret = merge(a, A[r], resL, resR);
// cerr<<l<<" "<<r<<": "<<ret<<endl;
    return ret;
  }
}


SegmentTreePoint<NodeMin> seg;
map<pair<int, int>, pair<int, vector<Mint>>> cache;

vector<Mint> solve(int l, int r) {
  const auto res = seg.get(l + 1, r);
  const int tm = max({seg.at(l).mx, res.mx, seg.at(r).mx});
  auto it = cache.find(make_pair(l, r));
  if (it != cache.end() && it->second.first == tm) return it->second.second;
  vector<Mint> ret;
  
  const int a = max(A[l], (r == N) ? 0 : A[r]);
  if (l + 1 == r) {
    ret.assign(a + 1, 0);
    for (int k = 0; k <= a; ++k) {
      ret[k] = (k == 0) ? (max(A[r], a) - a) : (k == 1) ? 1 : 0;
    }
    return ret;
  } else {
    const int m = res.mn.second;
// cerr<<l<<" "<<r<<": m = "<<m<<endl;
    const auto resL = solve(l, m);
    const auto resR = solve(m, r);
    ret = merge(a, A[r], resL, resR);
  }
// cerr<<l<<" "<<r<<": "<<ret<<endl;
  
  cache[make_pair(l, r)] = make_pair(tm, ret);
  return ret;
}


int main() {
  init();
  
  for (; ~scanf("%d%d%d", &N, &M, &Q); ) {
    A.assign(N + 1, 0);
    for (int i = 1; i <= N; ++i) {
      scanf("%d", &A[i]);
    }
    X.resize(Q);
    Y.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d", &X[q], &Y[q]);
    }
    
    cache.clear();
    
    seg = SegmentTreePoint<NodeMin>(N);
    for (int i = 0; i < N; ++i) {
      seg.at(i) = NodeMin(make_pair(make_pair(A[i], rng()), i), -1);
    }
    seg.build();
    
    for (int q = 0; q < Q; ++q) {
      if (A[X[q]] != Y[q]) {
        A[X[q]] = Y[q];
        seg.change(X[q], NodeMin(make_pair(make_pair(Y[q], rng()), X[q]), q));
      }
// cerr<<COLOR("33")<<"A = "<<A<<COLOR()<<endl;
      const auto res = solve(0, N);
      printf("%u\n", res[0].x);
    }
  }
  return 0;
}