#include <bits/stdc++.h>
#pragma GCC optimize(3)
using namespace std;
const long long N = 200010, Mod = 998244353;
inline long long read() {
  long long s = 0, w = 1;
  register char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') w = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9')
    s = (s << 3) + (s << 1) + (ch ^ 48), ch = getchar();
  return s * w;
}
long long n, Q, a[N], inv, mul[N], qz[N], Ans, imul[N];
inline long long ksc(long long x, long long p) {
  long long res = 1;
  for (; p; p >>= 1, x = x * x % Mod)
    if (p & 1) res = res * x % Mod;
  return res;
}
set<long long> g;
inline long long Get(long long l, long long r) {
  return ((qz[r - 2] - qz[l - 1] + Mod) * imul[l - 1] % Mod + 1) * mul[l - 1] %
         Mod * imul[r - 1] % Mod;
}
signed main() {
  n = read(), Q = read();
  inv = ksc(100, Mod - 2);
  for (register long long i = 1; i <= n; i++) {
    long long x = read();
    a[i] = x * inv % Mod;
  }
  mul[0] = 1;
  for (register long long i = 1; i <= n; i++) mul[i] = mul[i - 1] * a[i] % Mod;
  imul[n] = ksc(mul[n], Mod - 2);
  for (register long long i = n; i; i--) imul[i - 1] = imul[i] * a[i] % Mod;
  for (register long long i = 1; i <= n; i++)
    qz[i] = (qz[i - 1] + mul[i]) % Mod;
  Ans = (qz[n - 1] + 1) * imul[n] % Mod;
  g.insert(1), g.insert(n + 1);
  for (register long long i = 1; i <= Q; i++) {
    long long x = read();
    auto it = g.find(x);
    if (it != g.end()) {
      auto now = it;
      now++;
      long long R = (*now);
      now = it, now--;
      long long L = (*now);
      g.erase(it);
      (Ans += Get(L, R)) %= Mod;
      Ans = (Ans - Get(L, x) - Get(x, R) + Mod + Mod) % Mod;
    } else {
      g.insert(x);
      it = g.find(x);
      auto now = it;
      now++;
      long long R = (*now);
      now = it, now--;
      long long L = (*now);
      Ans = (Ans - Get(L, R) + Mod) % Mod;
      (Ans += Get(L, x) + Get(x, R)) %= Mod;
    }
    printf("%lld\n", Ans);
  }
  return 0;
}
