#include <bits/stdc++.h>
long long dx[8] = {0, 1, 0, -1, 1, 1, -1, -1};
long long dy[8] = {1, 0, -1, 0, -1, 1, 1, -1};
using namespace std;
class pa3 {
 public:
  long long x;
  long long y, z;
  pa3(long long x = 0, long long y = 0, long long z = 0) : x(x), y(y), z(z) {}
  bool operator<(const pa3 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    return z < p.z;
  }
  bool operator>(const pa3 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    return z > p.z;
  }
  bool operator==(const pa3 &p) const {
    return x == p.x && y == p.y && z == p.z;
  }
  bool operator!=(const pa3 &p) const {
    return !(x == p.x && y == p.y && z == p.z);
  }
};
class pa4 {
 public:
  long long x;
  long long y, z, w;
  pa4(long long x = 0, long long y = 0, long long z = 0, long long w = 0)
      : x(x), y(y), z(z), w(w) {}
  bool operator<(const pa4 &p) const {
    if (x != p.x) return x < p.x;
    if (y != p.y) return y < p.y;
    if (z != p.z) return z < p.z;
    return w < p.w;
  }
  bool operator>(const pa4 &p) const {
    if (x != p.x) return x > p.x;
    if (y != p.y) return y > p.y;
    if (z != p.z) return z > p.z;
    return w > p.w;
  }
  bool operator==(const pa4 &p) const {
    return x == p.x && y == p.y && z == p.z && w == p.w;
  }
};
class pa2 {
 public:
  long long x, y;
  pa2(long long x = 0, long long y = 0) : x(x), y(y) {}
  pa2 operator+(pa2 p) { return pa2(x + p.x, y + p.y); }
  pa2 operator-(pa2 p) { return pa2(x - p.x, y - p.y); }
  bool operator<(const pa2 &p) const { return y != p.y ? y < p.y : x < p.x; }
  bool operator>(const pa2 &p) const { return x != p.x ? x < p.x : y < p.y; }
  bool operator==(const pa2 &p) const {
    return abs(x - p.x) == 0 && abs(y - p.y) == 0;
  }
  bool operator!=(const pa2 &p) const {
    return !(abs(x - p.x) == 0 && abs(y - p.y) == 0);
  }
};
string itos(long long i) {
  ostringstream s;
  s << i;
  return s.str();
}
long long Gcd(long long v, long long b) {
  if (v == 0) return b;
  if (b == 0) return v;
  if (v > b) return Gcd(b, v);
  if (v == b) return b;
  if (b % v == 0) return v;
  return Gcd(v, b % v);
}
long long mod;
long long extgcd(long long a, long long b, long long &x, long long &y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extgcd(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
pair<long long, long long> operator+(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first + r.first, l.second + r.second};
}
pair<long long, long long> operator-(const pair<long long, long long> &l,
                                     const pair<long long, long long> &r) {
  return {l.first - r.first, l.second - r.second};
}
long long beki(long long wa, long long rr, long long warukazu) {
  if (rr == 0) return 1 % warukazu;
  if (rr == 1) return wa % warukazu;
  wa %= warukazu;
  if (rr % 2 == 1)
    return ((long long)beki(wa, rr - 1, warukazu) * (long long)wa) % warukazu;
  long long zx = beki(wa, rr / 2, warukazu);
  return (zx * zx) % warukazu;
}
long long pr[100000];
long long inv[100000];
long long comb(long long nn, long long rr) {
  if (rr < 0 || rr > nn || nn < 0) return 0;
  long long r = pr[nn] * inv[rr];
  r %= mod;
  r *= inv[nn - rr];
  r %= mod;
  return r;
}
void gya(long long ert) {
  pr[0] = 1;
  for (long long i = 1; i <= ert; i++) {
    pr[i] = ((long long)pr[i - 1] * i) % mod;
  }
  inv[ert] = beki(pr[ert], mod - 2, mod);
  for (long long i = ert - 1; i >= 0; i--) {
    inv[i] = (long long)inv[i + 1] * (i + 1) % mod;
  }
}
struct T {
  long long l;
  long long r;
  long long A;
  long long B;
  long long C;
  long long D;
  long long len;
};
T uni = {-1, -1, -1, -1, -1, -1, 0};
long long kai[20];
T me(T a, T b) {
  if (a.l == -1) return b;
  if (b.l == -1) return a;
  T ans;
  ans.l = a.l;
  ans.r = b.r;
  ans.len = a.len + b.len;
  ans.A = a.A * b.A % mod;
  if (a.r == 1) {
    ans.A += a.B * b.C % mod * kai[10 + b.l] % mod;
    ans.A %= mod;
  }
  if (b.len == 1) {
    ans.B = a.A;
  } else {
    ans.B = a.A * b.B % mod;
    if (a.r == 1) {
      ans.B += a.B * b.D % mod * kai[10 + b.l] % mod;
      ans.B %= mod;
    }
  }
  if (a.len == 1) {
    ans.C = b.A;
  } else {
    ans.C = a.C * b.A % mod;
    if (a.r == 1) {
      ans.C += a.D * b.C % mod * kai[10 + b.l] % mod;
      ans.C %= mod;
    }
  }
  if (a.len == 1 && b.len == 1) {
    ans.D = 1;
  } else if (a.len == 1) {
    ans.D = b.B;
  } else if (b.len == 1) {
    ans.D = a.C;
  } else {
    ans.D = a.C * b.B % mod;
    if (a.r == 1) {
      ans.D += a.D * b.D % mod * kai[10 + b.l] % mod;
      ans.D %= mod;
    }
  }
  return ans;
}
struct segsum {
 private:
 public:
  long long cor = (1 << 19);
  vector<T> vec;
  void shoki1() { vec.resize(2 * cor + 3, uni); }
  void shoki2() {
    for (long long i = cor - 1; i > 0; i--)
      vec[i] = me(vec[2 * i], vec[2 * i + 1]);
  }
  void updchan(long long x, T w) {
    x += cor;
    vec[x] = w;
    while (x) {
      x /= 2;
      vec[x] = me(vec[2 * x], vec[2 * x + 1]);
    }
  }
  T sum(long long a, long long b) {
    T hi = uni, mi = uni;
    a += cor, b += cor;
    while (a < b) {
      if (a & 1) {
        hi = me(hi, vec[a]);
        a++;
      }
      if (b & 1) {
        b--;
        mi = me(vec[b], mi);
      }
      a /= 2, b /= 2;
    }
    return me(hi, mi);
  }
};
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  mod = 998244353;
  for (long long i = 10; i <= 19; i++) {
    kai[i] = 19 - i;
  }
  segsum ss;
  ss.shoki1();
  long long n, m;
  cin >> n >> m;
  string s;
  cin >> s;
  for (long long i = 0; i < n; i++) {
    long long c = s[i] - '0';
    T hoge = {c, c, c + 1, 1, 1, 1, 1};
    ss.vec[ss.cor + i] = hoge;
  }
  ss.shoki2();
  for (long long er = 0; er < m; er++) {
    long long x, c;
    cin >> x >> c;
    x--;
    T hoge = {c, c, c + 1, 1, 1, 1, 1};
    ss.updchan(x, hoge);
    cout << ss.sum(0, n).A << endl;
  }
  return 0;
}
