// what is matter? never mind. 
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2") 
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define int long long
#define ull unsigned long long
using namespace std;
inline int read()
{
    char c=getchar();int x=0;bool f=0;
    for(;!isdigit(c);c=getchar())f^=!(c^45);
    for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
    if(f)x=-x;return x;
}

#define mod 998244353
struct modint{
	int x;
	modint(int o=0){x=o;}
	modint &operator = (int o){return x=o,*this;}
	modint &operator +=(modint o){return x=x+o.x>=mod?x+o.x-mod:x+o.x,*this;}
	modint &operator -=(modint o){return x=x-o.x<0?x-o.x+mod:x-o.x,*this;}
	modint &operator *=(modint o){return x=1ll*x*o.x%mod,*this;}
	modint &operator ^=(int b){
		modint a=*this,c=1;
		for(;b;b>>=1,a*=a)if(b&1)c*=a;
		return x=c.x,*this;
	}
	modint &operator /=(modint o){return *this *=o^=mod-2;}
	friend modint operator +(modint a,modint b){return a+=b;}
	friend modint operator -(modint a,modint b){return a-=b;}
	friend modint operator *(modint a,modint b){return a*=b;}
	friend modint operator /(modint a,modint b){return a/=b;}
	friend modint operator ^(modint a,int b){return a^=b;}
	friend bool operator ==(modint a,int b){return a.x==b;}
	friend bool operator !=(modint a,int b){return a.x!=b;}
	bool operator ! () {return !x;}
	modint operator - () {return x?mod-x:0;}
	bool operator <(const modint&b)const{return x<b.x;}
};
inline modint qpow(modint x,int y){return x^y;}

vector<modint> fac,ifac,iv;
inline void initC(int n)
{
	if(iv.empty())fac=ifac=iv=vector<modint>(2,1);
	int m=iv.size(); ++n;
	if(m>=n)return;
	iv.resize(n),fac.resize(n),ifac.resize(n);
	For(i,m,n-1){
		iv[i]=iv[mod%i]*(mod-mod/i);
		fac[i]=fac[i-1]*i,ifac[i]=ifac[i-1]*iv[i];
	}
}
inline modint C(int n,int m){
	if(m<0||n<m)return 0;
	return initC(n),fac[n]*ifac[m]*ifac[n-m];
}
inline modint sign(int n){return (n&1)?(mod-1):(1);}

#define poly vector<modint>
const modint G=3,Ginv=modint(1)/3;
inline poly one(){poly a;a.push_back(1);return a;}
vector<int>rev;
int rts[2100000];
inline int ext(int n){
	int k=0;
	while((1<<k)<n)++k;return k; 
}
inline void init(int k){
	int n=1<<k;
	rts[0]=1,rts[1<<k]=qpow(31,1<<(21-k)).x;
	Rep(i,k,1)rts[1<<(i-1)]=1ull*rts[1<<i]*rts[1<<i]%mod;
	For(i,1,n-1)rts[i]=1ull*rts[i&(i-1)]*rts[i&-i]%mod;
}

void ntt(poly&a,int k,int typ){
	int n=1<<k;
	static ull tmp[2100000];
	for(int i=0;i<n;++i)tmp[i]=a[i].x;
	if(typ==1){
		for(int l=n>>1;l>=1;l>>=1){
			ull*k=tmp;
			for(int*g=rts;k<tmp+n;k+=(l<<1),++g){
				for(ull*x=k;x<k+l;++x){
					int o=x[l]%mod*(*g)%mod;
					x[l]=*x+mod-o,*x+=o;
				}
			}
		}
		for(int i=0;i<n;++i)a[i].x=tmp[i]%mod;
	}else{
		for(int l=1;l<n;l<<=1){
			ull*k=tmp;
			for(int*g=rts;k<tmp+n;k+=(l<<1),++g){
				for(ull*x=k;x<k+l;++x){
					int o=x[l]%mod;
					x[l]=(*x+mod-o)*(*g)%mod,*x+=o;
				}
			}
		}
		int iv=qpow(n,mod-2).x;
		for(int i=0;i<n;++i)a[i].x=tmp[i]%mod*iv%mod;
		reverse(a.begin()+1,a.end());
	}
}
 
poly operator +(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]+=b[i];return a;
}
poly operator -(poly a,poly b){
	int n=max(a.size(),b.size());a.resize(n),b.resize(n);
	For(i,0,n-1)a[i]-=b[i];return a;
}
poly operator *(poly a,modint b){
	int n=a.size();
	For(i,0,n-1)a[i]*=b;return a;
} 
poly operator *(poly a,poly b){
	if(!a.size()||!b.size())return {};
	if((int)a.size()<=32 || (int)b.size()<=32){
		poly c(a.size()+b.size()-1,0);
		for(int i=0;i<a.size();++i)for(int j=0;j<b.size();++j)c[i+j]+=a[i]*b[j];
		return c; 
	}
	int n=(int)a.size()+(int)b.size()-1,k=ext(n);
	a.resize(1<<k),b.resize(1<<k);
	ntt(a,k,1),ntt(b,k,1);
	For(i,0,(1<<k)-1)a[i]*=b[i];
	ntt(a,k,-1),a.resize(n);return a;
}

poly Tmp;
poly pmul(poly a,poly b,int n,bool ok=0)
{
	int k=ext(n);
	a.resize(1<<k),ntt(a,k,1);
	if(!ok) b.resize(1<<k),ntt(b,k,1),Tmp=b;
	For(i,0,(1<<k)-1)a[i]*=Tmp[i];
	ntt(a,k,-1),a.resize(n);
	return a;
}
poly inv(poly a,int n)
{
	a.resize(n);
	if(n==1){
		poly f(1,1/a[0]);
		return f;
	}
	poly f0=inv(a,(n+1)>>1),f=f0;
	poly now=pmul(a,f0,n,0);
	for(int i=0;i<f0.size();++i)now[i]=0;
	now=pmul(now,poly(0),n,1);
	f.resize(n);
	for(int i=f0.size();i<n;++i)f[i]=-now[i];
	return f;
}
poly inv(poly a){return inv(a,a.size());}

poly deriv(poly a){
	int n=(int)a.size()-1;
	For(i,0,n-1)a[i]=a[i+1]*(i+1);
	a.resize(n);return a;
}
poly inter(poly a){
	int n=a.size()+1;a.resize(n); initC(n);
	Rep(i,n-1,1)a[i]=a[i-1]*iv[i];
	a[0]=0;return a;
}
poly ln(poly a){
	int n=a.size();
	a=deriv(a)*inv(a),a.resize(n-1);return inter(a);
}
poly exp(poly a,int k){
	int n=1<<k;a.resize(n);
	if(n==1)return one();
	poly f0=exp(a,k-1);f0.resize(n);
	return f0*(one()+a-ln(f0)); 
}
poly exp(poly a){
	int n=a.size();
	a=exp(a,ext(n));a.resize(n);return a;
}
poly div(poly a,poly b){
	int n=a.size(),m=b.size(),k=ext(n-m+1);
	reverse(a.begin(),a.end()),reverse(b.begin(),b.end());
	a.resize(n-m+1),b.resize(n-m+1);
	a=a*inv(b),a.resize(n-m+1),reverse(a.begin(),a.end()); return a;
}
poly modulo(poly a,poly b){
	if(b.size()>a.size())return a;
	int n=b.size()-1;
	a=a-div(a,b)*b;a.resize(n);return a;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;
 
#define maxn 200005
#define inf 0x3f3f3f3f

int n,m,l,r;
modint p,q;
modint a[maxn];
modint f[maxn];

modint g[maxn];

poly mul(poly a,poly b){
	poly res=a*b;
	int sz=res.size();
	For(i,2*m+2,sz-1) res[i-(m*2+2)]+=res[i];
	res.resize(2*m+2);
	return res;
}
poly mulself(poly f){
	int n=2*f.size()-1,k=ext(n);
    f.resize(1<<k),ntt(f,k,1);
    For(i,0,(1<<k)-1)f[i]*=f[i];
    ntt(f,k,-1),f.resize(n);return f;
}
poly muls(poly res){
	res=mulself(res);
	int sz=res.size();
	For(i,2*m+2,sz-1) res[i-(m*2+2)]+=res[i];
	res.resize(2*m+2);
	return res;
}
poly qp(poly a,int b){
	poly res={1};
	for(;b;b>>=1,a=mul(a,a)){
		if(b&1)res=mul(res,a);
	}
	return res;
}

void solve1()
{
	poly a,b;
	--m;
	a.resize(m*2+2),b.resize(m*2+2);
	b[0]=p;
	b[1]=b[m*2+1]=q;
	b=qp(b,r);
	For(i,1,m){
		a[i]+=::f[i];
		a[m*2+2-i]-=::f[i];
	}
	a=mul(a,b);
	modint res=0;
	For(i,1,m){
		res+=a[i]*min(i,m+1-i);
	}
	cout<<res.x;
}

poly get(int r){
	--m;
	poly a,b;
	a.resize(m*2+2),b.resize(m*2+2);
	b[0]=p;
	b[1]=b[m*2+1]=q;
	b=qp(b,r);
	For(i,1,m){
		a[i]+=::f[i];
		a[m*2+2-i]-=::f[i];
	}
	a=mul(a,b);
	return a;
}

 ull dp[maxn],dp2[maxn];

signed main()
{
//	freopen("data.in","r",stdin);
//	freopen("my.out","w",stdout);
	init(21);
	n=read(),m=read(),p=read(),l=read(),r=read();
	p=p*p+(1-p)*(1-p);
	q=(1-p)/2;
	For(i,1,n){
		int x=read();
		a[x]+=1;
	}
	
	poly F(m),G(m);
	For(i,0,m-1) F[i]=a[i],G[m-1-i]=a[i];
	F=F*G;
	For(i,0,m-1) f[i]=F[i+m-1];
//	For(i,0,m-1)
//		For(j,i+1,m-1)
//			f[j-i]+=a[j]*a[i];
	
	poly tmp=get(l);
	For(i,1,m) f[i]=tmp[i],dp[i]=tmp[i].x;
		{
			modint res=0;
			For(i,1,m)res+=min(i,m+1-i)*f[i];
			cout<<res.x<<" ";
		}
	int lim=(m+1)/2;
	For(i,lim+1,m) dp[m-i+1]=(dp[m-i+1]%mod+dp[i]%mod)%mod,dp[i]=0;
	For(_,l+1,r){
		ull lst=0;
		For(i,1,lim){
			dp[i-1]+=dp[i]*q.x;
			swap(lst,dp[i]);
			dp[i]+=lst*p.x;
			lst*=q.x;
		}
		dp[lim+1]=lst;
		For(i,lim+1,lim+1) dp[m-i+1]=(dp[m-i+1]%mod+dp[i]%mod)%mod,dp[i]=0;
		ull ans=0;
		For(i,1,lim){
			dp[i]%=mod;
			ans+=dp[i]*i;
		}
		ans%=mod;
		cout<<ans<<" ";
	}
	return 0;
}
/*


2 5 499122177 2 2
1 3

5 20 704273273 100 100
7 9 13 16 17

2 5 499122177 3 3
1 3

1 0 0
1 2 3
*/