#include <bits/stdc++.h>
#pragma comment(linker, "/STACK:1108864220")
using namespace std;
const int MOD = 998244353;
const int INF = 1000000000;
const double EPS = 1e-9;
const int HASH_POW = 29;
const long double PI = acos(-1.0);
mt19937_64 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
long long nextLong(long long l, long long r) {
  uniform_int_distribution<long long> foo(l, r);
  return foo(rnd);
}
double nextDouble(double l, double r) {
  uniform_real_distribution<double> foo(l, r);
  return foo(rnd);
}
double workTime() { return double(clock()) / CLOCKS_PER_SEC; }
void myReturn(int code = 0) { exit(code); }
int binPow(int a, int k) {
  int res = 1;
  while (k) {
    if (k & 1) {
      res = res * 1ll * a % MOD;
    }
    a = a * 1ll * a % MOD;
    k >>= 1;
  }
  return res;
}
int getInv(int a) { return binPow(a, MOD - 2); }
int n, q, p[200010], S[200010], T[200010];
int M(int l, int r) {
  int foo = (S[r] - S[l - 1] + MOD) % MOD;
  return foo * 1ll * getInv(T[r]) % MOD;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  scanf("%d %d", &n, &q);
  int den = getInv(100);
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &p[i]);
    p[i] = p[i] * 1ll * den % MOD;
  }
  T[0] = 1;
  for (int i = 1; i <= n; ++i) {
    T[i] = T[i - 1] * 1ll * p[i] % MOD;
  }
  S[0] = 0;
  S[1] = 1;
  for (int i = 2; i <= n; ++i) {
    S[i] = (S[i - 1] + T[i - 1]) % MOD;
  }
  set<int> pos;
  pos.insert(1);
  pos.insert(n + 1);
  int ans = M(1, n);
  while (q-- > 0) {
    int x;
    scanf("%d", &x);
    if (pos.find(x) != pos.end()) {
      auto foo = pos.upper_bound(x);
      int rr = *foo;
      --foo;
      --foo;
      int ll = *foo;
      ans -= M(ll, x - 1);
      if (ans < 0) {
        ans += MOD;
      }
      ans -= M(x, rr - 1);
      if (ans < 0) {
        ans += MOD;
      }
      ans = (ans + M(ll, rr - 1)) % MOD;
      pos.erase(x);
    } else {
      auto foo = pos.upper_bound(x);
      int rr = *foo;
      --foo;
      int ll = *foo;
      ans -= M(ll, rr - 1);
      if (ans < 0) {
        ans += MOD;
      }
      ans = (ans + M(ll, x - 1)) % MOD;
      ans = (ans + M(x, rr - 1)) % MOD;
      pos.insert(x);
    }
    printf("%d\n", ans);
  }
  myReturn();
}
