#include <bits/stdc++.h>
using namespace std;
const int N = 200001;
int n, q, p[N], prod[N], g[N], mod = 998244353;
int powlog(int a, int b) {
  if (b == 0) return 1;
  int ret = powlog(a, b / 2);
  if (b % 2) return 1LL * ret * ret % mod * a % mod;
  return 1LL * ret * ret % mod;
}
int calc(int l, int r) {
  r--;
  int ret = (g[r - 1] - g[l - 1] + mod) % mod;
  ret = (1LL * ret * powlog(prod[l - 1], mod - 2) + 1) % mod;
  ret = 1LL * ret *
        powlog(1LL * prod[r] * powlog(prod[l - 1], mod - 2) % mod, mod - 2) %
        mod;
  return ret;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> q;
  prod[0] = 1;
  for (int i = 1; i <= n; i++) {
    cin >> p[i];
    p[i] = 1LL * p[i] * powlog(100, mod - 2) % mod;
    prod[i] = 1LL * prod[i - 1] * p[i] % mod;
    g[i] = (g[i - 1] + prod[i]) % mod;
  }
  set<int> s;
  s.insert(1);
  s.insert(n + 1);
  int ans = calc(1, n + 1);
  for (int i = 0; i < q; i++) {
    int x;
    cin >> x;
    if (s.count(x)) {
      auto it = s.upper_bound(x);
      int r = *it;
      it--;
      it--;
      int l = *it;
      ans = (ans - calc(l, x) + mod) % mod;
      ans = (ans - calc(x, r) + mod) % mod;
      ans = (ans + calc(l, r)) % mod;
      s.erase(x);
    } else {
      auto it = s.upper_bound(x);
      int r = *it;
      it--;
      int l = *it;
      ans = (ans - calc(l, r) + mod) % mod;
      ans = (ans + calc(l, x)) % mod;
      ans = (ans + calc(x, r)) % mod;
      s.insert(x);
    }
    cout << ans << "\n";
  }
}
