#include <bits/stdc++.h>
using namespace std;
long long inf;
const double eps = 1e-8;
const double pi = acos(-1.0);
template <class T>
long long chkmin(T &a, T b) {
  return a > b ? a = b, 1 : 0;
}
template <class T>
long long chkmax(T &a, T b) {
  return a < b ? a = b, 1 : 0;
}
template <class T>
T sqr(T a) {
  return a * a;
}
template <class T>
T mmin(T a, T b) {
  return a < b ? a : b;
}
template <class T>
T mmax(T a, T b) {
  return a > b ? a : b;
}
template <class T>
T aabs(T a) {
  return a < 0 ? -a : a;
}
template <class T>
long long dcmp(T a, T b) {
  return a > b;
}
template <long long *a>
long long cmp_a(long long first, long long second) {
  return a[first] < a[second];
}
struct __INIT__ {
  __INIT__() { memset(&inf, 0x3f, sizeof(inf)); }
} __INIT___;
namespace io {
const long long SIZE = (1 << 21) + 1;
char ibuf[SIZE], *iS, *iT, obuf[SIZE], *oS = obuf, *oT = oS + SIZE - 1, c,
                                       qu[55];
long long f, qr;
inline void flush() {
  fwrite(obuf, 1, oS - obuf, stdout);
  oS = obuf;
}
inline void putc(char first) {
  *oS++ = first;
  if (oS == oT) flush();
}
inline bool read(signed &first) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (first = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    first = first * 10 + (c & 15);
  first *= f;
  return 1;
}
inline bool read(long long &first) {
  for (f = 1, c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                            : *iS++);
       c < '0' || c > '9';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    if (c == '-')
      f = -1;
    else if (c == EOF)
      return 0;
  for (first = 0; c <= '9' && c >= '0';
       c = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                     : *iS++))
    first = first * 10 + (c & 15);
  first *= f;
  return 1;
}
inline bool read(char &first) {
  first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                       (iS == iT ? EOF : *iS++))
                    : *iS++);
  return first != EOF;
}
inline bool read(char *first) {
  while ((*first = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                                (iS == iT ? EOF : *iS++))
                             : *iS++)) == '\n' ||
         *first == ' ' || *first == '\r')
    if (*first == EOF) return 0;
  while (!(*first == '\n' || *first == ' ' || *first == '\r'))
    *(++first) = (iS == iT ? (iT = (iS = ibuf) + fread(ibuf, 1, SIZE, stdin),
                              (iS == iT ? EOF : *iS++))
                           : *iS++);
  *first = 0;
  return 1;
}
template <typename A, typename... B>
inline bool read(A &first, B &...second) {
  return read(first) && read(second...);
}
inline bool write(signed first) {
  if (!first) putc('0');
  if (first < 0) putc('-'), first = -first;
  while (first) qu[++qr] = first % 10 + '0', first /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(long long first) {
  if (!first) putc('0');
  if (first < 0) putc('-'), first = -first;
  while (first) qu[++qr] = first % 10 + '0', first /= 10;
  while (qr) putc(qu[qr--]);
  return 0;
}
inline bool write(char first) {
  putc(first);
  return 0;
}
inline bool write(const char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
inline bool write(char *first) {
  while (*first) {
    putc(*first);
    ++first;
  }
  return 0;
}
template <typename A, typename... B>
inline bool write(A first, B... second) {
  return write(first) || write(second...);
}
struct Flusher_ {
  ~Flusher_() { flush(); }
} io_flusher_;
}  // namespace io
using io ::putc;
using io ::read;
using io ::write;
map<long long, long long> e;
long long inv[105];
const long long p = 998244353;
long long a[200005], ia[200005];
struct smt {
  long long k, b, ls, rs;
  smt *l, *r;
  smt(long long la, long long ra) {
    ls = la;
    rs = ra;
    if (ls == rs) {
      k = (p + 1 - a[ls]) * ia[ls] % p;
      b = ia[ls] % p;
    } else {
      long long mid = (ls + rs) >> 1;
      l = new smt(ls, mid);
      r = new smt(mid + 1, rs);
      k = (l->k + r->k * l->k + r->k) % p;
      b = (l->b + r->b + r->k * l->b) % p;
    }
  }
  void getv(long long &first, long long la, long long ra) {
    if (la <= ls && rs <= ra) {
      first = (first + first * k + b) % p;
      return;
    }
    if (la <= l->rs) l->getv(first, la, ra);
    if (r->ls <= ra) r->getv(first, la, ra);
  }
};
smt *rt;
signed main() {
  long long n, q;
  read(n, q);
  inv[1] = 1;
  for (long long i = 2; i <= 100; ++i) inv[i] = (p - p / i) * inv[p % i] % p;
  long long first, w;
  for (long long i = 1; i <= n; ++i) {
    read(first);
    a[i] = first * inv[100] % p;
    ia[i] = 100 * inv[first] % p;
  }
  rt = new smt(1, n);
  rt->getv(w = 0, 1, n);
  e[1] = w;
  long long ans = w;
  e[n + 1] = 0;
  long long cnt = 0;
  for (; q; --q) {
    read(first);
    if (e.count(first)) {
      auto it = e.lower_bound(first), it2 = it, it3 = it;
      ++it2;
      --it3;
      ans = (ans - it->second + p) % p;
      ans = (ans - it3->second + p) % p;
      e.erase(it);
      rt->getv(w = 0, it3->first, it2->first - 1);
      it3->second = w;
      ans = (ans + it3->second) % p;
      --cnt;
    } else {
      auto it = e.lower_bound(first), it2 = it;
      --it2;
      rt->getv(w = 0, it2->first, first - 1);
      ans = (ans + p - it2->second) % p;
      it2->second = w;
      ans = (ans + it2->second) % p;
      rt->getv(w = 0, first, it->first - 1);
      ans = (ans + w) % p;
      e[first] = w;
      ++cnt;
    }
    write(ans, '\n');
  }
  return 0;
}
