#include <bits/stdc++.h>
using namespace std;
const long long M = 998244353;
int n, q, p[200010], pprod[200010], sum1[200010], sum2[200010];
long long modpow(long long base, long long exp, long long modulus = M) {
  base %= modulus;
  long long result = 1;
  while (exp > 0) {
    if (exp & 1) result = (result * base) % modulus;
    base = (base * base) % modulus;
    exp >>= 1;
  }
  return result;
}
long long modinv(long long a, long long mod = M) {
  return modpow(a, mod - 2, mod);
}
long long S1(int l, int r) { return (M + sum1[r] - sum1[l - 1]) % M; }
long long S2(int l, int r) {
  long long dec = (1ll * (l - 1) * S1(l, r) + sum2[l - 1]) % M;
  long long ret = M + sum2[r] - dec;
  return (ret * modinv(pprod[l - 1])) % M;
}
long long E(int l, int r) {
  return (((S2(l, r) * pprod[l - 1]) % M) * modinv(pprod[r]) + (r - l + 1)) % M;
}
long long ans;
set<int> chkpt;
long long update(int x) {
  long long high = *chkpt.upper_bound(x);
  long long low = *prev(chkpt.lower_bound(x));
  if (chkpt.count(x)) {
    chkpt.erase(x);
    ans = (2 * M + ans - E(low + 1, x) - E(x + 1, high) + E(low + 1, high)) % M;
  } else {
    chkpt.insert(x);
    ans = (M + ans - E(low + 1, high) + E(low + 1, x) + E(x + 1, high)) % M;
  }
  return ans;
}
int main() {
  ios::sync_with_stdio(false);
  cin >> n >> q;
  pprod[0] = 1;
  for (int i = 1; i <= n; ++i) {
    cin >> p[i];
    p[i] = (1ll * p[i] * modinv(100)) % M;
    pprod[i] = (1ll * pprod[i - 1] * p[i]) % M;
    sum1[i] = (1ll * sum1[i - 1] + 1ll * pprod[i - 1] * (M + 1 - p[i])) % M;
    sum2[i] =
        (1ll * sum2[i - 1] + ((1ll * pprod[i - 1] * (M + 1 - p[i])) % M) * i) %
        M;
  }
  ans = E(1, n);
  chkpt.insert(0);
  chkpt.insert(n);
  while (q--) {
    int x;
    cin >> x;
    --x;
    cout << update(x) << endl;
  }
  return 0;
}
