#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],pw[N+1],F[N+1],delta[N+1],l,r,X;
long long ans[N+1];
string s;
int main()
{
    int d,sr,L,R;
    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
	{
	    d=(n-st[i-1])/(st[i-1]+1),sr=(n-st[i-1])%(st[i-1]+1);
	    for (int j=1;j<=st[i-1]+1;++j) F[j]=d+1;
	    L=1,R=st[i-1]+1;
	    for (int j=1;j<=sr;++j)
	    {
		if (j&1) F[L++]++;
		else F[R--]++;
	    }
	    for (int j=1;j<=st[i-1]+1;++j) delta[j]=delta[j-1]+F[j];
	    for (int j=2;j<=st[i-1]+1;++j) ans[i]+=1ll*F[j]*delta[j-1];
	}
    }
    for (int i=l;i<=r;++i) tans^=(1ll*(ans[i]%mod)*pw[i]%mod);
    printf("%d\n",tans);
    return 0;
}