#include<iostream>
#include<cstdio>
#include<vector>
#define N 200000
#define K 524288
#define M 20
#define g 3
#define mod 998244353
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x+=d;
	if (x>=mod) x-=mod;
	return;
}
void Adder2(int &x,int d)
{
	x+=d;
	if (x<0) x+=mod;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
int n,m,length,p,L,R,tong[N+1],leng,tong2[N+1],leng2,res[N+1],cnt[N+1],dp[N+1],rev[K+1],wn[M+1][K+1],wn2[M+1][K+1],A[K+1],B[K+1],num[K+1];
void NTT(int limit,int *s,int type)
{
	int s1,s2;
	for (int i=1;i<limit;++i) rev[i]=(rev[i>>1]>>1)|((i&1)?(limit>>1):0);
	for (int i=0;i<limit;++i)
		if (rev[i]>i)
			swap(s[i],s[rev[i]]);
	if (type==1)
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
	}
	else
	{
		for (int i=2;i<=limit;i<<=1)
			for (int j=0;j+i-1<limit;j+=i)
				for (int k=j;k<j+(i>>1);++k)
					s1=s[k],s2=1ll*s[k+(i>>1)]*wn2[num[i]][k-j]%mod,s[k]=MD(s1+s2),s[k+(i>>1)]=MD2(s1-s2);
		for (int i=0;i<limit;++i) s[i]=1ll*s[i]*fast_pow(limit,mod-2)%mod;
	}
	return;
}
struct reads
{
	int d[N+1];
};
reads e,nw,nws,c,cs,zero;
reads operator * (reads a,reads b)
{
	c=zero;
	int limit=1;
	while (limit<=(m<<2)) limit<<=1;
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=0;i<(m<<1);++i) A[i]=a.d[i],B[i]=b.d[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<(m<<2);++i) Adder(c.d[i%(m<<1)],A[i]);
	return c;
}
reads fast_pow(reads a,int b)
{
	int limit=1;
	while (limit<=(m<<2)) limit<<=1;
	reads res=e,mul=a;
	while (b)
	{
		if (b&1)
		{
			leng=leng2=0;
			for (int i=0;i<(m<<1);++i)
			{
				if (mul.d[i]) tong[++leng]=i;
				if (res.d[i]) tong2[++leng2]=i;
			}
			if (leng<=5000&&leng2<=5000)
			{
				c=cs=zero;
				for (int i=1;i<=leng;++i)
				{
					for (int j=1;j<=leng;++j) Adder(c.d[(tong[i]+tong[j])%(m<<1)],1ll*mul.d[tong[i]]*mul.d[tong[j]]%mod);
					for (int j=1;j<=leng2;++j) Adder(cs.d[(tong[i]+tong2[j])%(m<<1)],1ll*mul.d[tong[i]]*res.d[tong2[j]]%mod);
				}
				mul=c,res=cs;
			}
			else
			{
				for (int i=0;i<=limit;++i) A[i]=B[i]=0;
				for (int i=0;i<(m<<1);++i) A[i]=mul.d[i],B[i]=res.d[i];
				NTT(limit,A,1),NTT(limit,B,1);
				for (int i=0;i<=limit;++i) B[i]=1ll*A[i]*B[i]%mod,A[i]=1ll*A[i]*A[i]%mod;
				NTT(limit,A,-1),NTT(limit,B,-1);
				for (int i=0;i<(m<<1);++i) mul.d[i]=A[i],res.d[i]=B[i];
			}
		}
		else
		{
			leng=0;
			for (int i=0;i<(m<<1);++i)
				if (mul.d[i])
					tong[++leng]=i;
			if (leng<=5000)
			{
				c=zero;
				for (int i=1;i<=leng;++i)
					for (int j=1;j<=leng;++j)
						Adder(c.d[(tong[i]+tong[j])%(m<<1)],1ll*mul.d[tong[i]]*mul.d[tong[j]]%mod);
				mul=c;
			}
			else
			{
				for (int i=0;i<=limit;++i) A[i]=0;
				for (int i=0;i<(m<<1);++i) A[i]=mul.d[i];
				NTT(limit,A,1);
				for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*A[i]%mod;
				NTT(limit,A,-1);
				for (int i=0;i<(m<<1);++i) mul.d[i]=A[i];
			}
		}
		b>>=1;
	}
	return res;
}
vector<int>operator * (vector<int>a,vector<int>b)
{
	int limit=1;
	vector<int>c(a.size()+b.size()-1);
	while (limit<=a.size()+b.size()) limit<<=1;
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=0;i<a.size();++i) A[i]=a[i];
	for (int i=0;i<b.size();++i) B[i]=b[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<c.size();++i) c[i]=A[i];
	return c;
}
struct seg
{
	struct node
	{
		int l,r;
		vector<int>data;
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		tree[k].data=tree[k<<1].data*tree[k<<1|1].data;
		return;
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r;
		if (l==r)
		{
			tree[k].data={1ll*p*MD2(1-p)%mod,MD(1ll*p*p%mod+1ll*MD2(1-p)*MD2(1-p)%mod),1ll*p*MD2(1-p)%mod};
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
		return;	
	}
	void solve(int k,vector<int>sp)
	{
		if (tree[k].l==tree[k].r)
		{
			res[tree[k].l]=sp[1];
			return;
		}
		int limit=1;
		vector<int>sp1(tree[k<<1].data.size());
		vector<int>sp2(tree[k<<1|1].data.size());
		for (int i=0;i<tree[k<<1].data.size();++i) sp1[i]=sp[i+(tree[k<<1|1].data.size()>>1)];
		while (limit<=tree[k].data.size()) limit<<=1;
		for (int i=0;i<=limit;++i) A[i]=B[i]=0;
		for (int i=0;i<tree[k].data.size();++i) A[i]=sp[i];
		for (int i=0;i<tree[k<<1].data.size();++i) B[tree[k<<1].data.size()-i]=tree[k<<1].data[i];
		NTT(limit,A,1),NTT(limit,B,1);
		for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
		NTT(limit,A,-1);
		for (int i=0;i<tree[k<<1|1].data.size();++i) sp2[i]=A[tree[k<<1].data.size()+i];
		solve(k<<1,sp1),solve(k<<1|1,sp2);
		return;
	}
};
seg T;
int main()
{
	reads dst;
	int x,rst,limit=1;
	vector<int>sp;
	for (int i=2;i<=K;i<<=1)
	{
		num[i]=++length,rst=fast_pow(g,(mod-1)/i);
		for (int j=0,res=1;j<i;++j,res=1ll*res*rst%mod) wn[num[i]][j]=res;
		rst=fast_pow(g,(mod-1)/i*(i-1));
		for (int j=0,res=1;j<i;++j,res=1ll*res*rst%mod) wn2[num[i]][j]=res;
	}
	n=read(),m=read(),p=read(),L=read(),R=read(),e.d[0]=1,nw.d[1]=nw.d[(m<<1)-1]=1ll*p*MD2(1-p)%mod,nw.d[0]=MD(1ll*p*p%mod+1ll*MD2(1-p)*MD2(1-p)%mod);
	for (int i=1;i<=n;++i) x=read(),cnt[x]++;
	while (limit<=(m<<1)) limit<<=1;
	for (int i=0;i<m;++i) A[i]=cnt[i],B[m-i]=cnt[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=1;i<m;++i) nws.d[i]=A[m+i];
	dst=nws*fast_pow(nw,L);
	while (limit<=(m<<2)) limit<<=1;
	for (int i=0;i<=limit;++i) A[i]=B[i]=0;
	for (int i=1;i<m;++i) A[i]=min(i,m-i);
	for (int i=1;i<m;++i) A[i+m]=MD2(-min(i,m-i));
	for (int i=0;i<(m<<1);++i) B[(m<<1)-i]=dst.d[i];
	NTT(limit,A,1),NTT(limit,B,1);
	for (int i=0;i<=limit;++i) A[i]=1ll*A[i]*B[i]%mod;
	NTT(limit,A,-1);
	for (int i=0;i<(m<<2);++i) Adder(dp[i%(m<<1)],A[i]);
	sp.resize(((R-L+1)<<1)+1);
	for (int i=0;i<=((R-L+1)<<1);++i) sp[i]=dp[(i-(R-L+1)%(m<<1)+(m<<1))%(m<<1)];
	T.build(1,1,R-L+1),T.solve(1,sp);
	for (int i=1;i<=R-L+1;++i) printf("%d ",res[i]);
	puts("");
	return 0;
}