func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = 998244353;   const int C = 26;   void add(int &x, int y) {     x += y;     while (x >= MOD) x -= MOD;     while (x < 0) x += MOD;   }   int fix(int x) {     while (x >= MOD) x -= MOD;     while (x < 0) x += MOD;     return x;   }   int pw(int a, int b) {     int ret = 1;     while (b) {       if (b & 1) ret = 1ll * ret * a % MOD;       b >>= 1;       a = 1ll * a * a % MOD;     }     return ret;   }   int inv(int a) { return pw(a, MOD - 2); }   int mul(int a, int b) { return (long long)a * b % MOD; }   const int MAXN = 2e5 + 10;   const int LOG = 20;   int n, q, p[MAXN];   int tab[MAXN][LOG];   int get(int l, int r) {     int ans = 1;     for (int i = LOG - 1; ~i; --i)       if (l + (1 << i) <= r) ans = mul(ans, tab[l][i]), l += 1 << i;     return ans;   }   int st[MAXN << 2], lz[MAXN << 2];   int pr[MAXN];   void plant(int v, int b, int e) {     if (e - b == 1) {       st[v] = pr[b];       return;     }     int m = (b + e) >> 1;     plant(v << 1, b, m);     plant(v << 1 ^ 1, m, e);     st[v] = fix(st[v << 1] + st[v << 1 ^ 1]);   }   void weed(int v) {     for (int u : {v << 1, v << 1 ^ 1}) {       st[u] = mul(st[u], lz[v]);       lz[u] = mul(lz[u], lz[v]);     }     lz[v] = 1;   }   void water(int v, int b, int e, int l, int r, int x) {     if (l >= r) return;     if (b == l && e == r) {       st[v] = mul(st[v], x);       lz[v] = mul(lz[v], x);       return;     }     weed(v);     int m = (b + e) >> 1;     water(v << 1, b, m, l, min(r, m), x);     water(v << 1 ^ 1, m, e, max(l, m), r, x);     st[v] = fix(st[v << 1] + st[v << 1 ^ 1]);   }   int smoke(int v, int b, int e, int l, int r) {     if (l >= r) return 0;     if (b == l && e == r) return st[v];     weed(v);     int m = (b + e) >> 1;     return fix(smoke(v << 1, b, m, l, min(r, m)) +                smoke(v << 1 ^ 1, m, e, max(l, m), r));   }   void solve() {     cin >> n >> q;     for (int i = 0; i < n; i++) cin >> p[i];     for (int i = 0; i < n; i++) p[i] = mul(p[i], inv(100));     for (int i = 0; i < n; i++) tab[i][0] = p[i];     for (int j = 1; j < LOG; j++)       for (int i = 0; i < n; i++)         if (i + (1 << j) <= n)           tab[i][j] = mul(tab[i][j - 1], tab[i + (1 << (j - 1))][j - 1]);         else           tab[i][j] = tab[i][j - 1];     fill(lz, lz + (MAXN << 2), 1);     pr[n - 1] = inv(p[n - 1]);     for (int i = n - 2; ~i; --i) pr[i] = mul(pr[i + 1], inv(p[i]));     plant(1, 0, n);     set<int> pts;     pts.insert(0);     pts.insert(n);     while (q--) {       int u;       cin >> u;       --u;       if (pts.count(u)) {         auto prv = --pts.lower_bound(u);         water(1, 0, n, *prv, u, smoke(1, 0, n, u, u + 1));         pts.erase(u);       } else {         auto prv = --pts.lower_bound(u);         water(1, 0, n, *prv, u, inv(smoke(1, 0, n, u, u + 1)));         pts.insert(u);       }       cout << st[1] <<   n ;     }   }   int main() {     ios::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     int te = 1;     for (int w = 1; w <= te; w++) {       solve();     }     return 0;   }   