#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int inf = 1e9;
int mod = 998244353;
inline void add(int &a, int b) {
  a += b;
  if (a >= mod) a -= mod;
}
inline void sub(int &a, int b) {
  a -= b;
  if (a < 0) a += mod;
}
inline int mul(int a, int b) { return (int)((long long)a * b % mod); }
inline int power(int a, long long b) {
  int res = 1;
  while (b > 0) {
    if (b & 1) {
      res = mul(res, a);
    }
    a = mul(a, a);
    b >>= 1;
  }
  return res;
}
inline int inv(int a) {
  a %= mod;
  if (a < 0) a += mod;
  int b = mod, u = 0, v = 1;
  while (a) {
    int t = b / a;
    b -= t * a;
    swap(a, b);
    u -= t * v;
    swap(u, v);
  }
  assert(b == 1);
  if (u < 0) u += mod;
  return u;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, q;
  cin >> n >> q;
  int p[n + 1];
  p[0] = 1;
  for (int i = 1; i <= n; i++) {
    int x;
    cin >> x;
    p[i] = mul(x, inv(100));
  }
  int S[n + 1];
  S[0] = 1;
  for (int i = 1; i <= n; i++) {
    S[i] = mul(S[i - 1], p[i]);
  }
  int P[n + 1];
  P[0] = 0;
  int Pbar[n + 1];
  Pbar[0] = 0;
  for (int i = 1; i <= n; i++) {
    P[i] = P[i - 1];
    Pbar[i] = Pbar[i - 1];
    add(P[i], mul(S[i - 1], 1 - p[i] + mod));
    add(Pbar[i], mul(i, mul(S[i - 1], 1 - p[i] + mod)));
  }
  set<int> s;
  s.insert(1);
  s.insert(n + 1);
  function<int(int, int)> get = [&](int start, int end) -> int {
    int sum = Pbar[end - 1];
    sub(sum, Pbar[start - 1]);
    int div = P[end - 1];
    sub(div, P[start - 1]);
    int div1 = mul(div, start - 1);
    sub(sum, div1);
    sum = mul(sum, inv(S[start - 1]));
    int cnt = mul(S[end - 1], inv(S[start - 1]));
    cnt = mul(cnt, (end - start));
    int E = sum;
    add(E, cnt);
    div = P[end - 1];
    sub(div, P[start - 1]);
    div = mul(div, inv(S[start - 1]));
    div = mul(div, mod - 1);
    add(div, 1);
    E = mul(E, inv(div));
    return E;
  };
  int ans = get(1, n + 1);
  while (q--) {
    int u;
    cin >> u;
    int low, high;
    if (s.find(u) == s.end()) {
      auto it = s.lower_bound(u);
      high = *(it);
      it--;
      low = *(it);
      sub(ans, get(low, high));
      add(ans, get(low, u));
      add(ans, get(u, high));
      s.insert(u);
    } else {
      s.erase(s.find(u));
      auto it = s.lower_bound(u);
      high = *(it);
      it--;
      low = *(it);
      sub(ans, get(u, high));
      sub(ans, get(low, u));
      add(ans, get(low, high));
    }
    cout << ans << "\n";
  }
  return 0;
}
