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>
namespace std {
bool __LOG_ = false;
const int N = 200002;
const int logN = 20;
const int MOD7 = 1000000007;
const long long MOD9 = 998244353;
const long long MODL = 1000000007;
const int INF = 1000000007;
const long long INFL = 4ll * 1000000007ll * 1000000007ll;
const long double PI = acos(-1);
const int HPRIME = 31;
const long double EPS = 1e-30;
inline void No() { cout << "NO" << endl; }
inline void Yes() { cout << "YES" << endl; }
template <typename T1, typename T2>
std::istream& operator>>(std::istream& in, std::pair<T1, T2>& p) {
  return in >> p.first >> p.second;
}
template <typename T1, typename T2>
std::ostream& operator<<(std::ostream& out, const std::pair<T1, T2> p) {
  return out << p.first << " " << p.second;
}
template <typename T>
std::istream& operator>>(std::istream& in, vector<T>& vec) {
  for (auto& x : vec) {
    in >> x;
  }
  return in;
}
template <typename T>
std::ostream& operator<<(std::ostream& out, const vector<T>& vec) {
  for (auto x : vec) {
    out << x << " ";
  }
  return out;
}
template <typename T1, typename T2>
std::vector<T1>& operator+=(std::vector<T1>& a, const std::vector<T2>& b) {
  assert(a.size() == b.size());
  for (size_t i = 0; i < a.size(); ++i) {
    a[i] += b[i];
  }
  return a;
}
template <typename T1, typename T2>
std::vector<T1>& operator-=(std::vector<T1>& a, const std::vector<T2>& b) {
  assert(a.size() == b.size());
  for (size_t i = 0; i < a.size(); ++i) {
    a[i] -= b[i];
  }
  return a;
}
template <typename T1, typename T2>
std::vector<T1>& operator*=(std::vector<T1>& a, const std::vector<T2>& b) {
  assert(a.size() == b.size());
  for (size_t i = 0; i < a.size(); ++i) {
    a[i] *= b[i];
  }
  return a;
}
template <typename T1, typename T2>
std::vector<T1>& operator/=(std::vector<T1>& a, const std::vector<T2>& b) {
  assert(a.size() == b.size());
  for (size_t i = 0; i < a.size(); ++i) {
    a[i] /= b[i];
  }
  return a;
}
template <typename T>
std::vector<T> operator+(const std::vector<T>& a, const std::vector<T>& b) {
  std::vector<T> ans(a);
  ans += b;
  return ans;
}
template <typename T>
std::vector<T> operator-(const std::vector<T>& a, const std::vector<T>& b) {
  std::vector<T> ans(a);
  ans -= b;
  return ans;
}
template <typename T>
std::vector<T> operator*(const std::vector<T>& a, const std::vector<T>& b) {
  std::vector<T> ans(a);
  ans *= b;
  return ans;
}
template <typename T>
std::vector<T> operator/(const std::vector<T>& a, const std::vector<T>& b) {
  std::vector<T> ans(a);
  ans /= b;
  return ans;
}
template <typename T>
T max(std::vector<T> v) {
  T ans = v[0];
  for (auto x : v) {
    ans = std::max(ans, x);
  }
  return ans;
}
template <typename T>
T min(std::vector<T> v) {
  T ans = v[0];
  for (auto x : v) {
    ans = std::min(ans, x);
  }
  return ans;
}
template <typename T1, typename T2>
std::pair<T1, T2> operator+(const std::pair<T1, T2>& a,
                            const std::pair<T1, T2>& b) {
  return std::pair<T1, T2>(a.first + b.first, a.second + b.second);
}
template <typename T1, typename T2>
std::pair<T1, T2> operator-(const std::pair<T1, T2>& a,
                            const std::pair<T1, T2>& b) {
  return std::pair<T1, T2>(a.first - b.first, a.second - b.second);
}
template <typename T1, typename T2>
std::pair<T1, T2> operator*(const std::pair<T1, T2>& a,
                            const std::pair<T1, T2>& b) {
  return std::pair<T1, T2>(a.first * b.first, a.second * b.second);
}
template <typename T1, typename T2>
std::pair<T1, T2> operator/(const std::pair<T1, T2>& a,
                            const std::pair<T1, T2>& b) {
  return std::pair<T1, T2>(a.first / b.first, a.second / b.second);
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.setf(ios::fixed);
  cout.precision(10);
}
bool prime(long long n) {
  if (n == 1) return false;
  if (n == 2) return true;
  if (n % 2 == 0) return false;
  for (long long i = 3; i * i <= n; i += 2) {
    if (n % i == 0) return false;
  }
  return true;
}
long long binpow(long long a, long long b, long long mod = MOD7) {
  long long res = 1;
  while (b) {
    if (b & 1) {
      res = (res * a) % mod;
    }
    a = (a * a) % mod;
    b >>= 1;
  }
  return res;
}
long long hak(long long a, long long mod = MOD7) {
  return binpow(a, mod - 2, mod);
}
}  // namespace std
using namespace std;
void precalc() {}
void solve() {
  long long art = 1;
  long long n;
  cin >> n;
  vector<long long> a(n);
  cin >> a;
  long long hak100 = hak(100ll, MOD9);
  long long ans = 0;
  long long cur = 1;
  for (int i = 0; i < n; i++) {
    ans =
        (ans + ((cur * (100 - a[i])) % MOD9 * hak100) % MOD9 * (i + 1)) % MOD9;
    cur = ((cur * a[i]) % MOD9 * hak100) % MOD9;
  }
  ans = (ans + cur * n) % MOD9;
  ans = (ans * hak(cur % MOD9, MOD9)) % MOD9;
  cout << ans << endl;
}
int main() {
  __LOG_ = true;
  cout.setf(ios::fixed);
  cout.precision(20);
  fastIO();
  precalc();
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}