#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mod 998244353
int n,m;
int l,r,x;
char s[500001];
int pw[500001];
namespace solve01{
	void solve(){
		int ans0=n*(n+1)/2;
		int ans1=ans0;
		int num=x+s[0]-'0';
		int rt=(n-num)/num;
		int o2=rt?(n-num)%rt:n-num;int o1=n-num-o2*(rt+1); 
		ans1-=o2*((rt+1)*(rt+2)/2)+o1*(rt*(rt+1)/2);
		ans1%=mod;ans0%=mod; 
		int ans=ans0 ^ (ans1*pw[1]%mod);
		cout<<ans<<endl;
		return ;
	}
}
namespace solvem{
	void solve(){
		int ans=(n-m+2)*(n-m+1)/2;
		ans%=mod;
		cout<<ans*pw[m]%mod<<endl;
		return ;
	}
}
namespace btf{
	int o[11];
	int ptr=0;
	int ans[11];
	int ss[11];
	int cnt[11];
	void check(){
		int ptr=0;memset(ss,0,sizeof(ss));
		for(int i=1;i<=n;i++){
			memset(cnt,0,sizeof(cnt));ptr=0;
			for(int j=i;j<=n;j++){
				cnt[o[j]]++;
				while(cnt[ptr])ptr++;
				ss[ptr]++;
			}
		}
		for(int i=m-1;i>=0;i--)ss[i]=(ss[i]+ss[i+1])%mod;
		for(int i=0;i<m;i++)ans[i]=max(ans[i],ss[i]);
		return ;
	}
	void solve(){
		memset(ans,0,sizeof(ans));
		for(int i=0;i<m;i++){
			for(int j=1;j<=x+s[i]-'0';j++){
				o[++ptr]=i;
			}
		}
		check();
		while(next_permutation(o+1,o+n+1))check();
		int an=0;
		for(int i=l;i<=r;i++)an=an^ (ans[i]*pw[i]%mod);
		cout<<an<<endl;
		return ;
	}
}
signed main(){
	pw[0]=1;
	for(int i=1;i<=500000;i++)pw[i]=pw[i-1]*233%mod; 
	cin>>m>>l>>r>>x;n=m*x;
	for(int i=0;i<m;i++){cin>>s[i];n+=s[i]-'0';}
	if(n<=9)btf::solve();
	else if(l==0 and r==1)solve01::solve();
	else if(l==m and r==m)solvem::solve();
}