#include <bits/stdc++.h>
using namespace std;
using ULL = unsigned long long;
const int N = 200005;
const ULL MOD = 998244353;
ULL gcd(ULL x, ULL y) {
  if (x == 0) {
    return (y);
  }
  return (gcd(y % x, x));
}
ULL power(ULL x, ULL y, ULL m) {
  if (y == 0) {
    return (1);
  }
  ULL tmp = power(x, y / 2, m) % m;
  tmp = (tmp * tmp) % m;
  if ((y & 1) == 0) {
    return (tmp);
  } else {
    return ((tmp * x) % m);
  }
}
ULL modInverse(ULL x, ULL m) {
  ULL g = gcd(x, m);
  if (g != 1) {
    exit(1);
  }
  return (power(x, m - 2, m));
}
int n, q;
ULL ar[N];
ULL qp[N];
ULL prefix[N];
ULL mult(ULL x, ULL y) { return ((x * y) % MOD); }
ULL add(ULL x, ULL y) { return ((x + y) % MOD); }
ULL sub(ULL x, ULL y) { return ((x - y + MOD) % MOD); }
ULL expect(int l, int r) {
  ULL a = sub(prefix[r - 1], prefix[l - 1]);
  a = mult(a, modInverse(qp[l - 1], MOD));
  a = add(a, 1);
  ULL b = mult(qp[r], modInverse(qp[l - 1], MOD));
  return (mult(a, modInverse(b, MOD)));
}
int main() {
  scanf("%d%d", &n, &q);
  for (int i = 1; i <= n; ++i) {
    scanf("%lld", &ar[i]);
  }
  prefix[0] = 0;
  qp[0] = 1;
  ULL now = 1;
  for (int i = 1; i <= n; ++i) {
    now = mult(now, ar[i]);
    now = mult(now, modInverse(100, MOD));
    qp[i] = now;
    prefix[i] = add(prefix[i - 1], qp[i]);
  }
  ULL ans = expect(1, n);
  set<int> st;
  st.insert(1);
  st.insert(n + 1);
  while (q--) {
    int x;
    scanf("%d", &x);
    if (st.find(x) != st.end()) {
      auto it = st.find(x);
      auto left = prev(it);
      auto right = next(it);
      ans = sub(ans, expect(*left, x - 1));
      ans = sub(ans, expect(x, *right - 1));
      ans = add(ans, expect(*left, *right - 1));
      st.erase(x);
    } else {
      auto right = st.lower_bound(x);
      auto left = prev(right);
      ans = sub(ans, expect(*left, *right - 1));
      ans = add(ans, expect(*left, x - 1));
      ans = add(ans, expect(x, *right - 1));
      st.insert(x);
    }
    printf("%lld\n", ans);
  }
  return (0);
}
