#include<bits/stdc++.h>
using namespace std;
const int mod=998244353;
int m,l,r,x,n;
string s;
int w[10000003],t,pw[10000003],ans,minn[10000003];
long long calc(int N,int t){
	int k=t/N;
	return (k-1ll)*k/2*N+t%N*k;
}
int main(){
	ios::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	cin>>m>>l>>r>>x>>s;
	for(int i=0;i<m;i++)
		w[i]=x+s[i]-'0',n+=w[i];
	minn[0]=1e9;
	for(int i=0;i<m;i++)
		minn[i+1]=min(minn[i],w[i]);
	pw[0]=1;
	for(int i=1;i<=m;i++)
		pw[i]=233ll*pw[i-1]%mod;
	for(int i=m;i>=0;i--){
		t+=w[i];
		int N=n-t;
		long long f=n*(n+1ll)/2;
		if(i){
			f-=(N+N-i+2ll)*(i-1)/2;
			f-=1ll*i*t;
			if(t<=2*(i-1))
				f-=calc(2,t);
			else{
				f-=(i-1ll)*(i-2);
				int tt=t-2*(i-1);
				f-=(i-1ll)*tt;
				f-=calc(minn[i]+1,tt);
			}
		}
		if(l<=i&&i<=r)
			ans^=(f%mod*pw[i])%mod;
	}cout<<ans;
}