#include <bits/stdc++.h>

const int N = 5050;
const int mod = 998244353;

inline int inc(int x, int y) { x += y - mod; return x + (x >> 31 & mod); }
inline int dec(int x, int y) { x -= y; return x + (x >> 31 & mod); } 
inline int mul(int x, int y) { return 1ll * x * y % mod; }

inline void upd(int &x, int y) { x = inc(x, y); }
inline void pud(int &x, int y) { x = mul(x, y); }  

int a[N], f[N][N << 1], n, p, q;
#define g(i, j) f[i][j + 5001]

inline int fastpow(int x, int p)
{
	int r = 1;
	while (p)
	{
		if (p & 1) pud(r, x);
		pud(x, x);
		p >>= 1;
	}
	return r;
}

template <int T>
struct fast_io
{
	char p[T], q[T], * p1, * p2, * q1, * q2;
	fast_io()
	{
		p1 = p2 = p;
		q1 = q, q2 = q + T;
	}
	inline char gc()
	{
		return p1 == p2 && (p2 = (p1 = p) + fread(p, 1, T, stdin), p1 == p2) ? EOF : *p1++;
	}
	inline void pc(char c)
	{
		if (q1 == q2) q2 = (q1 = q) + fwrite(q, 1, T, stdout);
		*q1++ = c;
	}
	~fast_io()
	{
		fwrite(q, 1, q1 - q, stdout);
	}
};
fast_io<1 << 20> io;
inline int read()
{
	int res = 0, neg = 1;
	char ch;
	do 
	{
		ch = io.gc();
		if (ch == '-') neg = -1;
	} while (ch < 48 || ch > 57);
	do res = res * 10 + ch - 48, ch = io.gc(); while (ch >= 48 && ch <= 57);
	return res * neg;
}

inline void put(int64_t x)
{
	if (x < 0) io.pc('-'), x = -x;
	if (x >= 10) put(x / 10);
	io.pc(48 + x % 10);
}
inline void output(int64_t x, char ch = ' ')
{
	put(x);
	io.pc(ch);
}


int main()
{
	n = read(), p = mul(read(), fastpow(100, mod - 2));
	q = dec(1, p);
	for (int i = 1; i <= n; ++i) a[i] = read();
	g(n, 0) = 1;
	for (int k = n - 1; k >= 0; --k)
		for (int i = -n; i <= n; ++i)
			if (i) g(k, i) = inc(mul(g(k + 1, i), p), mul(g(k + 1, i - a[k + 1]), q));
			else g(k, i) = 1;
	int ans = 0;
	for (int i = -n; i <= n; ++i)
		upd(ans, g(0, i));
	pud(ans, fastpow(n + n + 1, mod - 2));
	printf("%d", ans);
	return 0;
}