#include<bits/stdc++.h>
#define M 5005
#define int long long
using namespace std;
int mod = 998244353;
int a[M], dp[2][M * 2];
int qpow(int x, int ti)
{
    int ans = 1;
    while (ti)
	{
        if(ti & 1) ans = ans * x % mod;
        ti >>= 1;
        x = x * x % mod;
    }
    return ans % mod;
}
signed main()
{
	int n, p;
	scanf("%lld%lld", &n, &p);
	p = p * qpow(100, mod - 2) % mod;
	for(int i = 1; i <= n; i++) scanf("%lld", &a[i]);
	dp[(n + 1) & 1][n] = 1;
	for(int i = n; i >= 1; i--)
	{
		memset(dp[i & 1], 0, sizeof(dp[i & 1]));
		for(int j = 0; j <= n * 2; j++)
		{
			dp[i & 1][j] = (dp[(i + 1) & 1][j] * p % mod + ((j < a[i]) ? 0 : (dp[(i + 1) & 1][j - a[i]] * (1 + mod - p) % mod))) % mod;
		}
		dp[i & 1][n] = 1;
	}
	int ans = 0;
	for(int i = 0; i <= n * 2; i++) (ans += dp[1][i]) %= mod;
	printf("%lld\n", ans * qpow(2 * n + 1, mod - 2) % mod);
	return 0;
}