#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
int sum(int a, int b) {
  a += b;
  if (a >= MOD) a -= MOD;
  return a;
}
int sub(int a, int b) {
  a -= b;
  if (a < 0) a += MOD;
  return a;
}
int mult(int a, int b) { return (a * 1LL * b) % MOD; }
int bin_pow(int a, int n) {
  int res = 1;
  for (; n; n >>= 1, a = mult(a, a))
    if (n & 1) res = mult(res, a);
  return res;
}
int inv(int a) { return bin_pow(a, MOD - 2); }
const int N = (int)2e5 + 5;
int p[N], P[N], s[N];
int calc(int l, int r) { return mult(sub(s[r], s[l]), inv(P[r])); }
int main() {
  int n, q;
  scanf("%d %d", &n, &q);
  int inv100 = inv(100);
  P[0] = 1;
  for (int i = 0; i < n; ++i) {
    int x;
    scanf("%d", &x);
    p[i] = mult(x, inv100);
    P[i + 1] = mult(P[i], p[i]);
  }
  s[0] = 0;
  for (int i = 0; i <= n; ++i) s[i + 1] = sum(s[i], P[i]);
  int ans = calc(0, n);
  set<int> S;
  S.insert(0);
  S.insert(n);
  while (q--) {
    int pos;
    scanf("%d", &pos);
    --pos;
    if (S.count(pos)) {
      S.erase(pos);
      auto it = S.lower_bound(pos);
      int r = *it;
      int l = *(--it);
      ans = sub(ans, calc(l, pos));
      ans = sub(ans, calc(pos, r));
      ans = sum(ans, calc(l, r));
    } else {
      auto it = S.lower_bound(pos);
      int r = *it;
      int l = *(--it);
      ans = sub(ans, calc(l, r));
      ans = sum(ans, calc(l, pos));
      ans = sum(ans, calc(pos, r));
      S.insert(pos);
    }
    printf("%d\n", ans);
  }
}
