//Author: Kevin
#include<bits/stdc++.h>
//#pragma GCC optimize("O2")
using namespace std;
#define ll long long
#define ull unsigned ll
#define pb emplace_back
#define mp make_pair
#define ALL(x) (x).begin(),(x).end()
#define rALL(x) (x).rbegin(),(x).rend()
#define srt(x) sort(ALL(x))
#define rev(x) reverse(ALL(x))
#define rsrt(x) sort(rALL(x))
#define sz(x) (int)(x.size())
#define inf 0x3f3f3f3f
#define pii pair<int,int>
#define lb(v,x) (int)(lower_bound(ALL(v),x)-v.begin())
#define ub(v,x) (int)(upper_bound(ALL(v),x)-v.begin())
#define uni(v) v.resize(unique(ALL(v))-v.begin())
#define longer __int128_t
void die(string S){puts(S.c_str());exit(0);}
const ll mod=998244353;
ll ksm(ll a,ll b)
{
	ll ans=1;
	while(b)
	{
		if(b&1) ans=ans*a%mod;
		b>>=1;
		a=a*a%mod;
	}
	return ans;
}
ll dp[5050][5050],f[5050][5050];
void upd(ll &a,ll b)
{
	a+=b;
	a%=mod;
}
int a[5050];
int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	int n;
	ll p;
	cin>>n>>p;
	for(int i=0;i<n;i++)
		cin>>a[i];
	p=p*ksm(100,mod-2)%mod;
	ll ans=0;
	for(int i=0;i<2;i++)
	{
		memset(dp,0,sizeof(dp));
		memset(f,0,sizeof(f));
		f[0][0]=1;
		for(int j=0;j<n;j++)
			for(int k=0;k<=j;k++)
			{
				upd(f[j+1][k],f[j][k]*p);
				upd(f[j+1][max(0,k+a[j])],f[j][k]*(mod+1-p));
				upd(dp[j+1][k],dp[j][k]*p);
				upd(dp[j+1][max(0,k+a[j])],dp[j][k]*(mod+1-p));
				if(a[j]==-1&&k==0)
					upd(dp[j+1][0],f[j][0]*(mod+1-p));
			}
		upd(ans,accumulate(dp[n],dp[n]+n+1,0ll));
		for(int j=0;j<n;j++)
			a[j]*=-1;
	}
	cout<<(ans+1)*ksm(n+n+1,mod-2)%mod<<endl;
	return 0;
}