#include<bits/stdc++.h>
using namespace std;

const int maxm=1e7+10;
const int base=233;
const int mod=998244353;

inline int read(){
    int x=0,w=1;char c=getchar();
    while(c<'0'||c>'9'){if(c=='-')w=-1;c=getchar();}
    while(c<='9'&&c>='0'){x=(x<<3)+(x<<1)+c-'0';c=getchar();}
    return x*w;
}

inline int q_pow(int A,int B,int P){
    int res=1;
    while(B){
        if(B&1) res=1ll*res*A%P;
        A=1ll*A*A%P;
        B>>=1;
    }
    return res;
}
inline int S(int L,int R){
    return 1ll*(L+R)*(R-L+1)/2%mod;
}

int n,m,l,r,x;
bool chk=true;
char s[maxm];
int f[maxm];
int ans;

int main(){
    freopen("mex.in","r",stdin);
    freopen("mex.out","w",stdout);
    m=read(),l=read(),r=read(),x=read();
    scanf("%s",s);
    n=m*x;
    for(int i=0;i<m;++i){
        if(s[i]=='1') ++n;
    }
    f[0]=S(1,n);
    int cnt0=0,cnt1=n;
    for(int i=1;i<=m;++i){
        cnt0+=x,cnt1-=x;
        if(s[i-1]=='1') ++cnt0,--cnt1;
        else chk=false;
        f[i]=(S(1,cnt0-i+1)+S(cnt0+1,n))%mod;
        if(2*i-2>=cnt1){
            f[i]=(f[i]+1ll*(mod-i+1)*cnt1)%mod;
            f[i]=(f[i]-2ll*S(1,cnt1/2)%mod+mod)%mod;
            f[i]=(f[i]-1ll*(cnt1%2)*(cnt1/2+1)%mod+mod)%mod;
        }
        else{
            f[i]=(f[i]+1ll*(mod-i+1)*(2*i-2))%mod;
            f[i]=(f[i]-2ll*S(1,i-1)%mod+mod)%mod;
            f[i]=(f[i]+2ll*(mod-i+1)*(cnt1-2*i+2)%mod)%mod;
            f[i]=(f[i]-1ll*(x+1+chk)*S(1,(cnt1-2*i+2)/(x+1+chk))%mod+mod)%mod;
            f[i]=(f[i]-1ll*((cnt1-2*i+2)%(x+1+chk))*((cnt1-2*i+2)/(x+1+chk)+1)%mod+mod)%mod;
        }
    }
    int pw=q_pow(base,l,mod);
    for(int i=l;i<=r;++i){
        ans^=1ll*pw*f[i]%mod;
        pw=1ll*pw*base%mod;
    }
    printf("%d\n",ans);
    return 0;
}