#include <bits/stdc++.h>
using namespace std;
const double PI = acos(-1.0);
const int INF = 1000 * 1000 * 1000 + 7;
const long long LINF = (long long)INF * INF;
const int mod = 998244353;
const int MAX = 1 << 18;
int add(int a, int b) { return a + b < mod ? a + b : a + b - mod; }
int sub(int a, int b) { return a - b >= 0 ? a - b : a - b + mod; }
int mult(int a, int b) { return (long long)a * b % mod; }
int binPow(int a, int n) {
  int res = 1;
  while (n) {
    if (n & 1) res = mult(res, a);
    a = mult(a, a);
    n >>= 1;
  }
  return res;
}
int p[MAX];
int prod[MAX];
int invProd[MAX];
int T[MAX << 1];
int getInvProd(int l, int r) { return mult(invProd[r], l ? prod[l - 1] : 1); }
void build(int v, int tl, int tr) {
  if (tl == tr) {
    T[v] = binPow(p[tl], mod - 2);
    return;
  }
  int tm = (tl + tr) / 2;
  build(v * 2, tl, tm);
  build(v * 2 + 1, tm + 1, tr);
  T[v] = add(mult(T[v * 2], getInvProd(tm + 1, tr)), T[v * 2 + 1]);
}
int query(int v, int tl, int tr, int l, int r) {
  if (l > r) return 0;
  if (l == tl && r == tr) return T[v];
  int tm = (tl + tr) / 2;
  int lVal = query(v * 2, tl, tm, l, min(r, tm));
  int rVal = query(v * 2 + 1, tm + 1, tr, max(l, tm + 1), r);
  if (r <= tm) return lVal;
  if (l > tm) return rVal;
  return add(mult(lVal, getInvProd(tm + 1, r)), rVal);
}
int main() {
  int n, q;
  scanf("%d%d", &n, &q);
  for (int i = (0); i < (n); ++i) {
    scanf("%d", p + i);
    p[i] = mult(p[i], binPow(100, mod - 2));
    prod[i] = mult(i ? prod[i - 1] : 1, p[i]);
    invProd[i] = binPow(prod[i], mod - 2);
  }
  build(1, 0, n - 1);
  int ans = T[1];
  set<int> s{0, n};
  while (q--) {
    int u;
    scanf("%d", &u);
    u--;
    auto it = s.lower_bound(u);
    bool was = *it == u;
    s.insert(u);
    it = s.lower_bound(u);
    auto itL = it, itR = it;
    itL--;
    itR++;
    int delta = sub(
        query(1, 0, n - 1, *itL, *itR - 1),
        add(query(1, 0, n - 1, *itL, u - 1), query(1, 0, n - 1, u, *itR - 1)));
    if (was) {
      ans = add(ans, delta);
      s.erase(it);
    } else
      ans = sub(ans, delta);
    printf("%d\n", ans);
  }
  return 0;
}
