#include <bits/stdc++.h>
using namespace std;
set<int> S;
const int N = 200005, mod = 998244353;
int pi[N], sum[N], n, Q, inv100, res;
int inc(int a, int b) {
  a += b;
  return a >= mod ? a - mod : a;
}
int mul(int a, int b) { return 1ll * a * b % mod; }
int dec(int a, int b) {
  a -= b;
  return a < 0 ? a + mod : a;
}
int powe(int a, int b) {
  int v = 1;
  while (b) {
    if (b & 1) v = mul(v, a);
    a = mul(a, a);
    b >>= 1;
  }
  return v;
}
int cal(int l, int r) {
  return mul(dec(inc(pi[l - 1], sum[r - 2]), sum[l - 1]),
             powe(pi[r - 1], mod - 2));
}
int main() {
  int x, i;
  scanf("%d%d", &n, &Q);
  inv100 = powe(100, mod - 2);
  pi[0] = 1;
  for (i = 1; i <= n; i++) {
    scanf("%d", &x);
    x = mul(x, inv100);
    pi[i] = mul(pi[i - 1], x), sum[i] = inc(sum[i - 1], pi[i]);
  }
  S.insert(1), S.insert(n + 1);
  res = cal(1, n + 1);
  while (Q--) {
    scanf("%d", &x);
    int l = *--S.lower_bound(x), r = *S.upper_bound(x);
    if (S.count(x))
      res = dec(res, inc(cal(l, x), cal(x, r))), res = inc(res, cal(l, r)),
      S.erase(x);
    else
      res = inc(res, inc(cal(l, x), cal(x, r))), res = dec(res, cal(l, r)),
      S.insert(x);
    printf("%d\n", res);
  }
  return 0;
}
