/*
倒序即可，fk
如果正序来做，那么无法得知转移到的位置是否之前走过
逆序做的话，影响的位置只有0，/fk
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 5050, mod = 998244353;
int n, p, q;
int a[N];
int f[N][N << 1];
int qow(int a, int b) {
    int ans = 1;
    while (b) {
        if (b & 1) ans = ans * a % mod;
        b >>= 1, a = a * a % mod;
    }
    return ans;
}
signed main() {
    scanf("%lld%lld", &n, &p), p = p * qow(100, mod - 2) % mod, q = (mod + 1 - p) % mod;
    for (int i = 1; i <= n; ++i) scanf("%lld", a + i);
    f[n + 1][n] = 1;
    for (int i = n; i >= 1; f[i][n] = 1, --i)
        for (int j = 0; j <= 2 * n; ++j)
            f[i][j] = (f[i + 1][j] * p + (j - a[i] >= 0 ? f[i + 1][j - a[i]] * q : 0)) % mod;
    int ret = 0;
    for (int j = 0; j <= 2 * n; ++j) ret = (ret + f[1][j]) % mod;
    ret = ret * qow(2 * n + 1, mod - 2) % mod;
    printf("%lld\n", ret);
    return 0;
}