#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 10, mod = 998244353;
int seg[4 * N], flag[4 * N], ps[N];
void relax(int ind) {
  int x = flag[ind];
  flag[ind] = 1;
  seg[2 * ind] = 1ll * seg[2 * ind] * x % mod;
  flag[2 * ind] = 1ll * flag[2 * ind] * x % mod;
  seg[2 * ind + 1] = 1ll * seg[2 * ind + 1] * x % mod;
  flag[2 * ind + 1] = 1ll * flag[2 * ind + 1] * x % mod;
}
void add(int s, int e, int ind, int l, int r, int val) {
  if (s >= r || e <= l) return;
  if (s >= l && e <= r) {
    seg[ind] = 1ll * seg[ind] * val % mod;
    flag[ind] = 1ll * flag[ind] * val % mod;
    return;
  }
  relax(ind);
  int mid = (s + e) / 2;
  add(s, mid, 2 * ind, l, r, val);
  add(mid, e, 2 * ind + 1, l, r, val);
  seg[ind] = (seg[2 * ind] + seg[2 * ind + 1]) % mod;
}
void build(int s, int e, int ind, int l, int r, int val) {
  if (s >= r || e <= l) return;
  if (s >= l && e <= r) {
    seg[ind] = val;
    return;
  }
  int mid = (s + e) / 2;
  build(s, mid, 2 * ind, l, r, val);
  build(mid, e, 2 * ind + 1, l, r, val);
  seg[ind] = (seg[2 * ind] + seg[2 * ind + 1]) % mod;
}
inline int pw(int x, int y) {
  int ret = 1;
  for (; y; y /= 2) {
    if (y & 1) ret = 1ll * ret * x % mod;
    x = 1ll * x * x % mod;
  }
  return ret;
}
inline int rev(int x) { return pw(x, mod - 2); }
int a[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, q;
  cin >> n >> q;
  for (int i = 0; i < n; i++) cin >> a[i];
  for (int i = 0; i < 4 * N; i++) flag[i] = 1;
  ps[n] = 1;
  for (int i = n - 1; i >= 0; i--) {
    ps[i] = 100ll * ps[i + 1] % mod * rev(a[i]) % mod;
    build(0, n, 1, i, i + 1, ps[i]);
  }
  set<int> s;
  s.insert(0);
  while (q--) {
    int v;
    cin >> v;
    v--;
    if (s.find(v) != s.end()) {
      auto it = s.lower_bound(v);
      it--;
      int x = *it;
      it = s.upper_bound(v);
      int y = n;
      if (it != s.end()) y = *it;
      int pss = 1ll * ps[v] * rev(ps[y]) % mod;
      add(0, n, 1, x, v, pss);
      s.erase(v);
    } else {
      auto it = s.lower_bound(v);
      it--;
      int x = *it;
      it = s.upper_bound(v);
      int y = n;
      if (it != s.end()) y = *it;
      int pss = 1ll * ps[v] * rev(ps[y]) % mod;
      add(0, n, 1, x, v, rev(pss));
      s.insert(v);
    }
    cout << seg[1] << "\n";
  }
  return 0;
}
