#include <bits/stdc++.h>
#pragma GCC optimize(3, "Ofast", "inline")
using namespace std;
const long long maxn = 1e6;
const long long mod = 998244353;
const long long inf = 0x3f3f3f3f;
long long qp(long long x, long long y) {
  long long ans = 1;
  while (y) {
    if (y & 1) ans = ans * x % mod;
    x = x * x % mod;
    y >>= 1;
  }
  return ans;
}
long long p[maxn];
long long pre[maxn];
long long sum[maxn];
set<long long> s;
bool vis[maxn];
long long query(long long l, long long r) {
  if (l == 1) {
    long long a = (sum[r - 1] + 1) % mod;
    long long b = pre[r] % mod;
    return a * qp(b, mod - 2) % mod;
  }
  long long a =
      (sum[r - 1] - sum[l - 2] + mod) % mod * qp(pre[l - 1], mod - 2) % mod;
  long long b = (pre[r] * qp(pre[l - 1], mod - 2)) % mod;
  return a * qp(b, mod - 2) % mod;
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  pre[0] = 1;
  long long n, q;
  cin >> n >> q;
  s.insert(1);
  s.insert(n + 1);
  for (long long i = 1; i <= n; ++i) {
    cin >> p[i];
    p[i] = p[i] * qp(100, mod - 2) % mod;
    pre[i] = pre[i - 1] * p[i] % mod;
    sum[i] = (sum[i - 1] + pre[i]) % mod;
  }
  long long ans = query(1, n);
  while (q--) {
    long long x;
    cin >> x;
    if (vis[x]) {
      vis[x] = false;
      s.erase(x);
      auto l = s.lower_bound(x);
      auto r = l;
      --l;
      ans = (ans + query(*l, *r - 1)) % mod;
      ans = (ans - query(*l, x - 1) + mod) % mod;
      ans = (ans - query(x, *r - 1) + mod) % mod;
    } else {
      vis[x] = true;
      auto l = s.lower_bound(x);
      auto r = l;
      --l;
      s.insert(x);
      ans = (ans - query(*l, *r - 1) + mod) % mod;
      ans = (ans + query(*l, x - 1)) % mod;
      ans = (ans + query(x, *r - 1)) % mod;
    }
    cout << ans << '\n';
  }
  return 0;
}
