#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;
long long calc(int x,int t,int d)
{
    if (t<=((d-1)<<1)) return ((1ll*(x-d)*(x-d+1))>>1)+1ll*((t+1)>>1)*(t>>1)+1ll*t*(x-d);
    else
    {
	t-=((d-1)<<1);
	int ds=t/((x-1)/d+1),r=t%((x-1)/d+1);
	long long res=1ll*((1ll*(x-d)*(x-d+1))>>1);
	res+=2ll*(d+ds-1)*(x-d)+1ll*((x-1)/d-1)*ds*(x-(d<<1)+1);
	res+=(((1ll*ds*((x-1)/d-1)+((d+ds-1)<<1))*(1ll*ds*((x-1)/d-1)+((d+ds-1)<<1))-(1ll*ds*ds*((x-1)/d-1)+((1ll*(d+ds-1)*(d+ds-1))<<1)))>>1);
	if (r) res+=(x-d)+1ll*ds*((x-1)/d-1)+(d+ds-1);
	if (r>=2) res+=1ll*(r-1)*(x-(d<<1)+1)+1ll*(r-1)*(((d+ds)<<1)-1)+1ll*(r-1)*((x-1)/d-2)*ds+((1ll*(r-1)*(r-2))>>1);
	return res;
    }
}
int main()
{
    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;
	else ans[i]=calc(st[i-1]+1,n-st[i-1],i);
    }
    for (int i=l;i<=r;++i) tans^=(1ll*(ans[i]%mod)*pw[i]%mod);
    printf("%d\n",tans);
    return 0;
}