#include<iostream>
#include<cstdio>
#include<algorithm>
#define N 20000000
#define inf 1e9
#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;
}
int n,m,tans,st[N+1],F[N+1],pw[N+1],delta[N+1],delta2[N+1],l,r,X;
long long ans[N+1];
string s;
int main()
{
    int sr,maxn,res,rt;
    m=read(),l=read(),r=read(),X=read(),cin>>s,pw[0]=1;
    for (int i=1;i<=N;++i) pw[i]=233ll*pw[i-1]%mod;
    for (int i=0;i<=m-1;++i)
    {
	st[i]=X+s[i]-'0';
	if (i) st[i]+=st[i-1];
    }
    n=st[m-1];
    for (int i=l;i<=r;++i)
    {
	if (!i) ans[i]=((1ll*n*(n+1))>>1)%mod;
	else
	{
	    sr=n-st[i-1];
	    for (int j=1;j<=st[i-1]+1;++j) F[j]=1;
	    for (int j=i+1;j<=st[i-1]+1;++j) ans[i]+=j-i;
	    for (int j=1;j<=sr;++j)
	    {
		for (int k=1;k<=st[i-1]+1;++k) delta[k]=delta[k-1]+F[k];
		delta2[st[i-1]+1]=rt=maxn=0;
		for (int k=st[i-1]+1;k>=1;--k) delta2[k]=delta2[k+1]+F[k];
		for (int k=1;k<=st[i-1]+1;++k)
		{
		    res=0;
		    if (k-i>=1) res+=delta[k-i];
		    if (k+i<=st[i-1]+1) res+=delta2[k+i];
		    if (res>maxn) maxn=res,rt=k;
		}
		ans[i]+=maxn,F[rt]++;
	    }
	}
    }
    for (int i=l;i<=r;++i) tans^=(1ll*(ans[i]%mod)*pw[i]%mod);
    printf("%d\n",tans);
    return 0;
}