#include <bits/stdc++.h>
using namespace std;
const int maxn = 3e5 + 20;
const int inf = 0x3f3f3f3f;
const int modd = 998244353;
inline int read() {
  int x = 0, f = 1;
  char c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') f = -1, c = getchar();
  while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
  return f * x;
}
template <class T>
inline void sc(T &x) {
  char c;
  x = 0;
  while ((c = getchar()) < '0')
    ;
  while (c >= '0' && c <= '9') x = x * 10 + (c - 48), c = getchar();
}
inline long long gcd(long long a, long long b) {
  return b == 0 ? a : gcd(b, a % b);
}
inline long long exgcd(long long a, long long b, long long &x, long long &y) {
  long long d;
  (b == 0 ? (x = 1, y = 0, d = a)
          : (d = exgcd(b, a % b, y, x), y -= a / b * x));
  return d;
}
inline long long qpow(long long a, long long n) {
  long long sum = 1;
  while (n) {
    if (n & 1) sum = sum * a % modd;
    a = a * a % modd;
    n >>= 1;
  }
  return sum;
}
inline long long qmul(long long a, long long n) {
  long long sum = 0;
  while (n) {
    if (n & 1) sum = (sum + a) % modd;
    a = (a + a) % modd;
    n >>= 1;
  }
  return sum;
}
inline long long inv(long long a) { return qpow(a, modd - 2); }
long long dp[maxn], s[maxn], ss[maxn];
set<int> st;
long long E(int l, int r) {
  long long ans =
      (((((ss[r - 1] - ss[l - 1] + modd) % modd) * inv(s[l - 1])) % modd) + 1) *
      inv(s[r] * inv(s[l - 1]) % modd) % modd;
  return ans;
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  s[0] = 1;
  for (int i = 1; i <= n; i++)
    scanf("%lld", &dp[i]), dp[i] = dp[i] * inv(100), dp[i] %= modd;
  for (int i = 1; i <= n; i++) s[i] = s[i - 1] * dp[i], s[i] %= modd;
  for (int i = 1; i <= n; i++) ss[i] = ss[i - 1] + s[i], ss[i] %= modd;
  st.insert(1);
  st.insert(n + 1);
  long long ans = E(1, n);
  while (q--) {
    int x;
    scanf("%d", &x);
    auto it = st.lower_bound(x);
    if (*it == x) {
      int l = *(--it);
      ++it;
      int r = *(++it);
      ans = ans - E(l, x - 1) + modd;
      ans %= modd;
      ans = ans - E(x, r - 1) + modd;
      ans %= modd;
      ans = ans + E(l, r - 1);
      ans %= modd;
      st.erase(x);
    } else {
      int l = *(--it);
      int r = *(++it);
      ans = ans - E(l, r - 1) + modd;
      ans %= modd;
      ans = ans + E(l, x - 1);
      ans %= modd;
      ans = ans + E(x, r - 1);
      ans %= modd;
      st.insert(x);
    }
    printf("%lld\n", ans);
  }
}
