Problem: Creatnx has n mirrors, numbered from 1 to n. Every day, Creatnx asks exactly one mirror "Am I beautiful?". The i-th mirror will tell Creatnx that he is beautiful with probability (p_i)/(100) for all 1 ≤ i ≤ n.

Some mirrors are called checkpoints. Initially, only the 1st mirror is a checkpoint. It remains a checkpoint all the time.

Creatnx asks the mirrors one by one, starting from the 1-st mirror. Every day, if he asks i-th mirror, there are two possibilities:

  * The i-th mirror tells Creatnx that he is beautiful. In this case, if i = n Creatnx will stop and become happy, otherwise he will continue asking the i+1-th mirror next day; 
  * In the other case, Creatnx will feel upset. The next day, Creatnx will start asking from the checkpoint with a maximal number that is less or equal to i. 



There are some changes occur over time: some mirrors become new checkpoints and some mirrors are no longer checkpoints. You are given q queries, each query is represented by an integer u: If the u-th mirror isn't a checkpoint then we set it as a checkpoint. Otherwise, the u-th mirror is no longer a checkpoint.

After each query, you need to calculate [the expected number](https://en.wikipedia.org/wiki/Expected_value) of days until Creatnx becomes happy.

Each of this numbers should be found by modulo 998244353. Formally, let M = 998244353. It can be shown that the answer can be expressed as an irreducible fraction p/q, where p and q are integers and q not ≡ 0 \pmod{M}. Output the integer equal to p ⋅ q^{-1} mod M. In other words, output such an integer x that 0 ≤ x < M and x ⋅ q ≡ p \pmod{M}.

Input

The first line contains two integers n, q (2 ≤ n, q ≤ 2 ⋅ 10^5) — the number of mirrors and queries.

The second line contains n integers: p_1, p_2, …, p_n (1 ≤ p_i ≤ 100).

Each of q following lines contains a single integer u (2 ≤ u ≤ n) — next query.

Output

Print q numbers – the answers after each query by modulo 998244353.

Examples

Input


2 2
50 50
2
2


Output


4
6


Input


5 5
10 20 30 40 50
2
3
4
5
3


Output


117
665496274
332748143
831870317
499122211

Note

In the first test after the first query, the first and the second mirrors are checkpoints. Creatnx will ask the first mirror until it will say that he is beautiful, after that he will ask the second mirror until it will say that he is beautiful because the second mirror is a checkpoint. After that, he will become happy. Probabilities that the mirrors will say, that he is beautiful are equal to 1/2. So, the expected number of days, until one mirror will say, that he is beautiful is equal to 2 and the answer will be equal to 4 = 2 + 2.

Solution (in CPP):

Solution:
#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;
}