#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int mod=998244353,inv2=(mod+1)/2;
int n,m,L,R,X,anss;
string S;
int calc(int x){
	ll o=1ll*x*(x+1)/2;
	return o%mod; 
}
int wk(int all,int x){
	if (x>all)return 0;
	return 1ll*x*(all-x)%mod;
}
int main(){
//	freopen("mex.in","r",stdin);freopen("mex.out","w",stdout);
	ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin>>m>>L>>R>>X>>S;
	n=m*X;
	for (int i=0;i<m;++i)n+=(S[i]^48);
	if (L==0)anss^=(calc(n)%mod);
	int res=X+(S[0]^48);  
	int ha=S[0]^48;
	for (int i=1,now=233;i<=R;++i,now=1ll*now*233%mod){
		int zu=X+1+(ha==1),s=0,ss=0;
		s=(s+calc(res-i+1))%mod;
		if (n-res-2*(i-1)<0){
			int le=n-res;
			s=(s+1ll*le*max(res-i+1,0)%mod)%mod;
			s=(s+1ll*(le/2)*(le-le/2)%mod)%mod;
		}
		else{
			int tmp=max(n-res-2*(i-1),0);
			int p=tmp/zu;
			int mo=tmp%zu;
			int mid=tmp-min(mo,2)-p*2;
			s=(s+1ll*mid*max(res-2*i+2,0)%mod)%mod;
			s=(s+1ll*max(n-res-mid,0)*max(res-i+1,0)%mod)%mod;
			ss=(ss+wk(n-res,i-1+p+min(mo,1)))%mod;
			ss=(ss+wk(n-res,i-1+p+min(max(mo-1,0),1)))%mod;
			mo=max(mo-2,0);
			ss=(ss+1ll*wk(n-res,p+1)*mo%mod)%mod;
			ss=(ss+1ll*wk(n-res,p)*(zu-2-mo)%mod)%mod;
			s=(s+1ll*ss*inv2%mod)%mod;
		}
		if (i<m)res+=(S[i]^48)+X;
		ha&=(S[i]^48);
		if (i>=L)anss^=1ll*now*s%mod;
	}
	cout<<anss;
}