#include <bits/stdc++.h>
using namespace std;
const long long N = 500010;
const long long inf = 1e9;
const long long mod = 998244353;
inline long long read() {
  long long p = 0;
  long long f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    p = p * 10 + ch - '0';
    ch = getchar();
  }
  return p * f;
}
long long p[N];
long long n, q;
long long suf[N];
long long fac[N];
long long qpow(long long x, long long k, long long mo) {
  long long s = 1;
  while (k) {
    if (k & 1) s = s * x % mo;
    x = x * x % mo;
    k >>= 1;
  }
  return s;
}
bool bo[N];
set<long long> s;
set<long long>::iterator it;
int main() {
  n = read();
  q = read();
  long long inv100 = qpow(100, mod - 2, mod);
  for (long long i = 1; i <= n; i++) p[i] = read();
  suf[n + 1] = 1;
  for (long long i = n; i >= 1; i--)
    suf[i] = suf[i + 1] * qpow(p[i], mod - 2, mod) % mod * 100 % mod;
  suf[n + 1] = 0;
  for (long long i = n; i >= 1; i--) suf[i] = (suf[i] + suf[i + 1]) % mod;
  fac[n + 1] = 1;
  for (long long i = n; i >= 1; i--)
    fac[i] = fac[i + 1] * p[i] % mod * inv100 % mod;
  memset(bo, 0, sizeof(bo));
  bo[1] = 1;
  s.insert(1);
  s.insert(n + 1);
  long long ans = suf[1];
  while (q--) {
    long long x = read();
    if (!bo[x]) {
      bo[x] = 1;
      long long l, r;
      it = s.lower_bound(x);
      --it;
      l = *it;
      it = s.lower_bound(x);
      r = *it;
      ans = (ans - (suf[l] - suf[r]) * fac[r] % mod + mod) % mod;
      ans = (ans + (suf[x] - suf[r]) * fac[r] % mod + mod) % mod;
      ans = (ans + (suf[l] - suf[x]) * fac[x] % mod + mod) % mod;
      s.insert(x);
    } else {
      long long l, r;
      it = s.lower_bound(x);
      --it;
      l = *it;
      it = s.upper_bound(x);
      r = *it;
      ans = (ans - (suf[x] - suf[r]) * fac[r] % mod + mod) % mod;
      ans = (ans - (suf[l] - suf[x]) * fac[x] % mod + mod) % mod;
      ans = (ans + (suf[l] - suf[r]) * fac[r] % mod + mod) % mod;
      bo[x] = 0;
      s.erase(x);
    }
    printf("%lld\n", ans);
  }
  return 0;
}
