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 JAVA):

Solution:
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.util.stream.IntStream;
import java.util.Arrays;
import java.lang.reflect.Array;
import java.util.function.BiFunction;
import java.util.TreeSet;
import java.nio.charset.Charset;
import java.util.StringTokenizer;
import java.io.OutputStreamWriter;
import java.io.OutputStream;
import java.util.stream.LongStream;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.function.BinaryOperator;
import java.io.UncheckedIOException;
import java.util.Objects;
import java.io.Writer;
import java.io.BufferedReader;
import java.io.InputStream;
 
/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author mikit
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        LightScanner in = new LightScanner(inputStream);
        LightWriter out = new LightWriter(outputStream);
        CBeautifulMirrorsWithQueries solver = new CBeautifulMirrorsWithQueries();
        solver.solve(1, in, out);
        out.close();
    }
 
    static class CBeautifulMirrorsWithQueries {
        private static final int MOD = 998244353;
        private static final ModMath mod = new ModMath(MOD);
        private static final long INV100 = mod.inv(100);
 
        public void solve(int testNumber, LightScanner in, LightWriter out) {
            // out.setBoolLabel(LightWriter.BoolLabel.YES_NO_FIRST_UP);
            int n = in.ints();//, queries = in.ints();
            long[] p = in.longs(n);
            CBeautifulMirrorsWithQueries.Transition[] trans = new CBeautifulMirrorsWithQueries.Transition[n];
            for (int i = 0; i < n; i++) {
                long inv = mod.inv(p[i] * INV100 % MOD);
                trans[i] = new CBeautifulMirrorsWithQueries.Transition(inv, inv);
            }
            CBeautifulMirrorsWithQueries.SegmentTree st = new CBeautifulMirrorsWithQueries.SegmentTree(
                    trans,
                    (x, y) -> {
                        if (x.zero) return y;
                        if (y.zero) return x;
                        return new CBeautifulMirrorsWithQueries.Transition(x.a * y.a % MOD, (x.b * y.a + y.b) % MOD);
                    });
            //System.out.println(st.query(0, 1));
            //System.out.println(Arrays.toString(trans));
            TreeSet<Integer> checkpoints = new TreeSet<>();
            checkpoints.add(0);
            checkpoints.add(n);
            long ans = st.query(0, n).calc();
            out.ans(ans).ln();
            /* for (int query = 0; query < queries; query++) {
                int x = in.ints() - 1;
                int before = checkpoints.lower(x), after = checkpoints.higher(x);
                long first = st.query(before, x).calc(), second = st.query(x, after).calc(), all = st.query(before, after).calc();
                if (checkpoints.contains(x)) {
                    checkpoints.remove(x);
                    ans += MOD - first + MOD - second + all;
                    ans %= MOD;
                } else {
                    checkpoints.add(x);
                    ans += first + second + MOD - all;
                    ans %= MOD;
                }
                //System.out.printf("[%d, %d, %d) : (%d, %d, %d)\n", before, x, after, first, second, all);
                out.ans(ans).ln();
            } */
        }
 
        private static class Transition {
            long a;
            long b;
            boolean zero;
            private static CBeautifulMirrorsWithQueries.Transition ZERO = new CBeautifulMirrorsWithQueries.Transition();
 
            Transition(long a, long b) {
                this.a = a;
                this.b = b;
            }
 
            Transition() {
                zero = true;
            }
 
            long calc() {
                return b;
            }
 
            public String toString() {
                return "Transition{" +
                        "a=" + a +
                        ", b=" + b +
                        '}';
            }
 
        }
 
        static class SegmentTree {
            private final int n;
            private final int m;
            private final CBeautifulMirrorsWithQueries.Transition[] tree;
            private final BinaryOperator<CBeautifulMirrorsWithQueries.Transition> op;
            private static final CBeautifulMirrorsWithQueries.Transition ZERO = CBeautifulMirrorsWithQueries.Transition.ZERO;
 
            public SegmentTree(CBeautifulMirrorsWithQueries.Transition[] array, BinaryOperator<CBeautifulMirrorsWithQueries.Transition> op) {
                this.n = array.length;
                int msb = BitMath.extractMsb(n);
                this.m = n == msb ? msb : (msb << 1);
                this.tree = Reflection.newInstance(Reflection.getComponentClass(array), 2 * m - 1);
                this.op = op;
                Arrays.fill(tree, ZERO);
                System.arraycopy(array, 0, this.tree, m - 1, array.length);
                for (int i = m - 2; i >= 0; i--) {
                    tree[i] = op.apply(tree[2 * i + 1], tree[2 * i + 2]);
                }
            }
 
            public CBeautifulMirrorsWithQueries.Transition query(int l, int r) {
                CBeautifulMirrorsWithQueries.Transition left = ZERO, right = ZERO;
                l += m - 1;
                r += m - 1;
                while (l < r) {
                    if ((l & 1) == 0) {
                        left = op.apply(left, tree[l]);
                    }
                    if ((r & 1) == 0) {
                        right = op.apply(tree[r - 1], right);
                    }
                    l = l / 2;
                    r = (r - 1) / 2;
                }
                return op.apply(left, right);
            }
 
        }
 
    }
 
    static class Vec3l implements Comparable<Vec3l> {
        public long x;
        public long y;
        public long z;
 
        public Vec3l(long x, long y, long z) {
            this.x = x;
            this.y = y;
            this.z = z;
        }
 
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Vec3i vec3i = (Vec3i) o;
            return x == vec3i.x &&
                    y == vec3i.y &&
                    z == vec3i.z;
        }
 
        public int hashCode() {
            return Objects.hash(x, y, z);
        }
 
        public String toString() {
            return "(" + x + ", " + y + ", " + z + ")";
        }
 
        public int compareTo(Vec3l o) {
            if (x == o.x) {
                if (y == o.y) {
                    return Long.compare(z, o.z);
                }
                return Long.compare(y, o.z);
            }
            return Long.compare(x, o.x);
        }
 
    }
 
    static class Vec3i implements Comparable<Vec3i> {
        public int x;
        public int y;
        public int z;
 
        public Vec3i(int x, int y, int z) {
            this.x = x;
            this.y = y;
            this.z = z;
        }
 
        public boolean equals(Object o) {
            if (this == o) return true;
            if (o == null || getClass() != o.getClass()) return false;
            Vec3i vec3i = (Vec3i) o;
            return x == vec3i.x &&
                    y == vec3i.y &&
                    z == vec3i.z;
        }
 
        public int hashCode() {
            return Objects.hash(x, y, z);
        }
 
        public String toString() {
            return "(" + x + ", " + y + ", " + z + ")";
        }
 
        public int compareTo(Vec3i o) {
            if (x == o.x) {
                if (y == o.y) {
                    return Integer.compare(z, o.z);
                }
                return Integer.compare(y, o.z);
            }
            return Integer.compare(x, o.x);
        }
 
    }
 
    static class LightWriter implements AutoCloseable {
        private final Writer out;
        private boolean autoflush = false;
        private boolean breaked = true;
 
        public LightWriter(Writer out) {
            this.out = out;
        }
 
        public LightWriter(OutputStream out) {
            this(new BufferedWriter(new OutputStreamWriter(out, Charset.defaultCharset())));
        }
 
        public LightWriter print(char c) {
            try {
                out.write(c);
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }
 
        public LightWriter print(String s) {
            try {
                out.write(s, 0, s.length());
                breaked = false;
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
            return this;
        }
 
        public LightWriter ans(String s) {
            if (!breaked) {
                print(' ');
            }
            return print(s);
        }
 
        public LightWriter ans(long l) {
            return ans(Long.toString(l));
        }
 
        public LightWriter ln() {
            print(System.lineSeparator());
            breaked = true;
            if (autoflush) {
                try {
                    out.flush();
                } catch (IOException ex) {
                    throw new UncheckedIOException(ex);
                }
            }
            return this;
        }
 
        public void close() {
            try {
                out.close();
            } catch (IOException ex) {
                throw new UncheckedIOException(ex);
            }
        }
 
    }
 
    static class Reflection {
        public static <T> Class<? extends T> getComponentClass(T[] a) {
            return (Class<? extends T>) a.getClass().getComponentType();
        }
 
        public static <T> T[] newInstance(Class<T> clazz, int length) {
            return (T[]) Array.newInstance(clazz, length);
        }
 
    }
 
    static class LightScanner {
        private BufferedReader reader = null;
        private StringTokenizer tokenizer = null;
 
        public LightScanner(InputStream in) {
            reader = new BufferedReader(new InputStreamReader(in));
        }
 
        public String string() {
            if (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new UncheckedIOException(e);
                }
            }
            return tokenizer.nextToken();
        }
 
        public int ints() {
            return Integer.parseInt(string());
        }
 
        public long longs() {
            return Long.parseLong(string());
        }
 
        public long[] longs(int length) {
            return IntStream.range(0, length).mapToLong(x -> longs()).toArray();
        }
 
    }
 
    static final class BitMath {
        private BitMath() {
        }
 
        public static int extractMsb(int v) {
            v = (v & 0xFFFF0000) > 0 ? v & 0xFFFF0000 : v;
            v = (v & 0xFF00FF00) > 0 ? v & 0xFF00FF00 : v;
            v = (v & 0xF0F0F0F0) > 0 ? v & 0xF0F0F0F0 : v;
            v = (v & 0xCCCCCCCC) > 0 ? v & 0xCCCCCCCC : v;
            v = (v & 0xAAAAAAAA) > 0 ? v & 0xAAAAAAAA : v;
            return v;
        }
 
    }
 
    static class LongEuclidSolver {
        private LongEuclidSolver() {
        }
 
        public static Vec3l solve(long a, long b) {
            LongEuclidSolver.ReferenceLong p = new LongEuclidSolver.ReferenceLong(), q = new LongEuclidSolver.ReferenceLong();
            long d = solve(a, b, p, q);
            return new Vec3l(p.val, q.val, d);
        }
 
        private static long solve(long a, long b, LongEuclidSolver.ReferenceLong p, LongEuclidSolver.ReferenceLong q) {
            if (b == 0) {
                p.val = 1;
                q.val = 0;
                return a;
            } else {
                long d = solve(b, a % b, q, p);
                q.val -= (a / b) * p.val;
                return d;
            }
        }
 
        private static class ReferenceLong {
            private long val;
 
        }
 
    }
 
    static class ModMath {
        private static final int DEFAULT_MOD = 1_000_000_007;
        private final long mod;
 
        public ModMath(long mod, boolean unsafe) {
        /*if (!unsafe && !IntMath.isPrime(mod)) {
            throw new RuntimeException("This class is designed for primes!");
        }*/
            this.mod = mod;
        }
 
        public ModMath(long mod) {
            this(mod, false);
        }
 
        public ModMath() {
            this(DEFAULT_MOD, true);
        }
 
        public long mod(long x) {
            x %= mod;
            return x < 0 ? x + mod : x;
        }
 
        public long inv(long x) {
            //return pow(x, mod - 2);
            return mod(LongEuclidSolver.solve(x, mod).x);
        }
 
    }
}