#include<bits/stdc++.h>
#define fo(i,x,y) for(int i(x);i<=y;i=-~i)
#define fd(i,x,y) for(int i(x);i>=y;--i)
#define ll long long
using namespace std;

const int M=1e7+5,mo=998244353,base=233;

int m,l,r,X,n,pw[M],ans;
char s[M];

int read(){
    char ch(getchar());int nu(0),w(0);
    while(ch<48||ch>57){
        if(ch=='-')w=1;ch=getchar();
    }
    while(ch>=48&&ch<=57){
        nu=(nu<<1)+(nu<<3)+(ch^48);ch=getchar();
    }
    if(w)nu=-nu;
    return nu;
}

namespace task1{
    int a[105],b[105],c[105],f[105];
    bool vis[105],v[105];

    void dfs(int x){
        if(x>n){
            fo(i,0,m)c[i]=0;
            fo(l,1,n){
                fo(i,0,m-1)v[i]=false;
                int now(0);
                fo(r,l,n){
                    v[b[r]]=true;while(v[now])++now;++c[now];
                }
            }
            fd(i,m-1,0)c[i]+=c[i+1];
            fo(i,0,m)f[i]=max(f[i],c[i]);
            return;
        }
        fo(i,1,n)
        if(!vis[i]){
            b[x]=a[i];vis[i]=true;
            dfs(x+1);
            vis[i]=false;
        }
    }
    void solve(){
        fo(i,0,m-1){
            int cnt=s[i]^48?X+1:X;while(cnt--)a[++n]=i;
        }
        dfs(1);
        fo(i,l,r)ans^=1ll*f[i]*pw[i]%mo;
        printf("%d\n",ans);
    }
}

namespace task2{
    void solve(){
        int cnt(0);fo(i,0,m-1)if(s[i]^48)++cnt;
        n=m*X+cnt;
        ll tot=1ll*n*(n+1)>>1;
        ans^=tot%mo;
        if(m>1)tot-=s[1]^48?X+1:X;
        ans^=tot%mo*base%mo;
        printf("%d\n",ans);
    }
}

namespace task3{
    void solve(){
        fo(i,l,r){
            int x=(n-i+2)>>1;
            //printf("%d %d\n",i,1ll*x*(n-i+2-x));
            int res(0);
            if(i)res=1ll*x*(n-i+2-x)%mo*pw[i]%mo;
            else res=(1ll*n*(n+1)>>1)%mo;
            ans^=res;
        }
        printf("%d\n",ans);
    }
}

bool js3(){
    int cnt(0);fo(i,0,m-1)if(s[i]^48)++cnt;
    n=m*X+cnt;
    return n==m;
}
void solve(){
    if(m<=2&&l==0&&r==1){
        task2::solve();return;
    }
    if(js3()){
        task3::solve();return;
    }
    task1::solve();
}

int main(){
    m=read();l=read();r=read();X=read();
    pw[0]=1;fo(i,1,m)pw[i]=1ll*pw[i-1]*base%mo;
    scanf("%s",s);
    solve();
    return 0;
}