#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10;
const int mod = 998244353;
int addmod(int x, int y) {
  if (y < 0) y += mod;
  if (x + y >= mod) x -= mod;
  return x + y;
}
int qpow(int a, int b, int mo) {
  int res = 1;
  while (b) {
    if (b & 1) res = 1ll * res * a % mo;
    a = 1ll * a * a % mo;
    b >>= 1;
  }
  return res;
}
int sum[N], inv[N], p[N], pp[N], n, q, vis[N];
int calc(int l, int r) { return 1ll * addmod(sum[l], -sum[r]) * inv[r] % mod; }
set<int> ss;
int ans = 0;
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &p[i]);
    p[i] = 100ll * qpow(p[i], mod - 2, mod) % mod;
  }
  pp[n + 1] = 1;
  inv[n + 1] = 1;
  sum[n + 1] = 0;
  for (int i = n; i >= 1; i--) {
    pp[i] = 1ll * pp[i + 1] * p[i] % mod;
    sum[i] = addmod(sum[i + 1], pp[i]);
  }
  for (int i = 1; i <= n; i++) inv[i] = qpow(pp[i], mod - 2, mod);
  ss.insert(1);
  ss.insert(n + 1);
  ans = sum[1];
  for (int i = 1; i <= q; i++) {
    int x;
    scanf("%d", &x);
    vis[x] ^= 1;
    if (vis[x]) {
      int l = *--ss.lower_bound(x);
      int r = *ss.lower_bound(x);
      ans = addmod(ans, -calc(l, r));
      ans = addmod(ans, calc(l, x));
      ans = addmod(ans, calc(x, r));
      ss.insert(x);
    } else {
      int l = *--ss.lower_bound(x);
      int r = *++ss.lower_bound(x);
      ans = addmod(ans, calc(l, r));
      ans = addmod(ans, -calc(l, x));
      ans = addmod(ans, -calc(x, r));
      ss.erase(x);
    }
    printf("%d\n", ans);
  }
}
