#include <bits/stdc++.h>
using namespace std;
const int MAXN = 200005;
const int MOD = 998244353;
template <typename T>
inline void read(T &AKNOI) {
  T x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  AKNOI = flag * x;
}
namespace ModCalculator {
inline void Inc(int &x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}
inline void Dec(int &x, int y) {
  x -= y;
  if (x < 0) x += MOD;
}
inline int Add(int x, int y) {
  Inc(x, y);
  return x;
}
inline int Sub(int x, int y) {
  Dec(x, y);
  return x;
}
inline int Mul(int x, int y) { return 1LL * x * y % MOD; }
}  // namespace ModCalculator
using namespace ModCalculator;
inline int ksm(int x, int k) {
  int ret = 1;
  while (k) {
    if (k & 1) ret = Mul(ret, x);
    x = Mul(x, x);
    k >>= 1;
  }
  return ret;
}
inline int Inv(int x) { return ksm(x, MOD - 2); }
int n, q, vis[MAXN];
int prod[MAXN], pinv[MAXN], sum[MAXN];
set<int> S;
set<int>::iterator it;
inline int Query(int l, int r) {
  if (l == r) {
    return Mul(pinv[r], prod[l - 1]);
  }
  int up = Add(1, Mul(Sub(sum[r - 2], sum[l - 1]), pinv[l - 1]));
  int dn = Mul(pinv[r - 1], prod[l - 1]);
  return Mul(up, dn);
}
void init() {
  read(n);
  read(q);
  int invh = Inv(100);
  prod[0] = pinv[0] = 1;
  for (int i = 1; i <= n; ++i) {
    int p;
    read(p);
    p = Mul(p, invh);
    prod[i] = Mul(prod[i - 1], p);
    pinv[i] = Inv(prod[i]);
    sum[i] = Add(sum[i - 1], prod[i]);
  }
}
void solve() {
  S.insert(1);
  S.insert(n + 1);
  int ans = Query(1, n + 1);
  while (q--) {
    int u;
    read(u);
    if (!vis[u]) {
      S.insert(u);
      vis[u] = 1;
      it = S.find(u);
      --it;
      int l = *it;
      ++it;
      ++it;
      int r = *it;
      Dec(ans, Query(l, r));
      Inc(ans, Query(l, u));
      Inc(ans, Query(u, r));
    } else {
      it = S.find(u);
      --it;
      int l = *it;
      ++it;
      ++it;
      int r = *it;
      Dec(ans, Query(l, u));
      Dec(ans, Query(u, r));
      Inc(ans, Query(l, r));
      S.erase(u);
      vis[u] = 0;
    }
    printf("%d\n", ans);
  }
}
int main() {
  init();
  solve();
  return 0;
}
