#include <bits/stdc++.h>
using namespace std;
using ll = long long int;
using ull = unsigned long long int;
using dd = double;
using ldd = long double;
ll mod = 998244353;
ll bp(ll a, ll n) {
  ll ans = 1;
  while (n) {
    if (n & 1) ans = ans * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return ans;
}
int _size = 1 << 18;
pair<ll, ll> f(pair<ll, ll> a, pair<ll, ll> b) {
  if (a.first == -1 || b.first == -1) {
    return (a.first == -1 ? b : a);
  }
  pair<ll, ll> ans;
  ans.first = a.first * b.second + b.first + a.first;
  ans.first %= mod;
  ans.second = a.second * b.second + b.second + a.second;
  ans.second %= mod;
  return ans;
}
vector<pair<ll, ll>> tree(_size << 1, {-1, -1});
pair<ll, ll> get(int v, int l, int r, int fl, int fr) {
  if (r <= fl || fr <= l || r <= l) {
    return {-1, -1};
  }
  if (fl <= l && r <= fr) return tree[v];
  return f(get(v << 1, l, (r + l) >> 1, fl, fr),
           get(v << 1 | 1, (r + l) >> 1, r, fl, fr));
}
void solve() {
  int n, q;
  cin >> n >> q;
  vector<ll> arr(n);
  for (int i = 0; i < n; ++i) cin >> arr[i];
  ll ans = 0;
  for (int i = 0; i < n; ++i) {
    tree[i + _size].first = 100LL * bp(arr[i], mod - 2) % mod;
    tree[i + _size].second = (100LL - arr[i]) * bp(arr[i], mod - 2) % mod;
  }
  for (int i = _size - 1; i > 0; --i)
    tree[i] = f(tree[i << 1], tree[i << 1 | 1]);
  ans = get(1, 0, _size, 0, n).first;
  0;
  ;
  set<int> check;
  check.insert(n);
  check.insert(0);
  for (int i = 0; i < q; ++i) {
    int x;
    cin >> x;
    --x;
    if (check.find(x) != check.end()) {
      auto r = check.upper_bound(x);
      auto l = r;
      l--;
      l--;
      ans -= get(1, 0, _size, *l, x).first + get(1, 0, _size, x, *r).first;
      ans += get(1, 0, _size, *l, *r).first;
      ans %= mod;
      ans += mod;
      ans %= mod;
      check.erase(x);
    } else {
      auto r = check.upper_bound(x);
      auto l = r;
      l--;
      ans -= get(1, 0, _size, *l, *r).first;
      ans += get(1, 0, _size, *l, x).first + get(1, 0, _size, x, *r).first;
      ans %= mod;
      ans += mod;
      ans %= mod;
      check.insert(x);
    }
    cout << ans << '\n';
    0;
    ;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  int t;
  t = 1;
  for (int i = 0; i < t; ++i) solve();
  return 0;
}
