#include <bits/stdc++.h>
using namespace std;
typedef long long ll; 
const int N = 5005, MOD = 998244353;
inline int inv(int a) {
	int res = 1, p = MOD - 2;
	while(p) {
		if(p & 1) res = (ll)res * a % MOD;
		a = (ll)a * a % MOD;
		p >>= 1;
	}
	return res;
}

int n, p, a[N], f[N][N << 1];

int main() {
	scanf("%d %d", &n, &p);
	p = (ll)p * inv(100) % MOD;
	for(int i = 1; i <= n; i++) {
		scanf("%d", &a[i]);
	}
	f[0][n] = 1;
	for(int i = 1; i <= n; i++) {
		if(a[n - i + 1] == 1) {
			f[i][n] = 1;
			for(int j = n + 1; j <= n + i; j++) {
				f[i][j] = (((ll)p * f[i-1][j] + (ll)(1-p) * f[i-1][j-1]) % MOD + MOD) % MOD;
			}
			for(int j = n - i; j <= n - 1; j++) {
				f[i][j] = f[i - 1][j];
			}
		} else {
			f[i][n] = 1;
			for(int j = n - i; j <= n - 1; j++) {
				f[i][j] = (((ll)p * f[i-1][j] + (ll)(1-p) * f[i-1][j+1]) % MOD + MOD) % MOD;
			}
			for(int j = n + 1; j <= n + i; j++) {
				f[i][j] = f[i - 1][j];
			}
		}
	}
	ll ans = 0;
	for(int i = 0; i <= n * 2; i++) {
		ans += f[n][i];
	}
	printf("%lld\n", ans * inv(n * 2 + 1) % MOD);
	return 0;
}