#include<bits/stdc++.h>
using namespace std;
const int P=998244353;
inline long long F(int x,int y){return 1ll*(y-x+1)*(x+y)/2;}
inline long long G(int x,int k){return 1ll*x*(x+1)/2+1ll*x*(2*k-2);}
int n,m,L,R,X;
char _[10100000];
int main()
{
    cin>>m>>L>>R>>X>>_+1;
    n=m*X;for(int i=1;i<=m;++i)n+=(_[i]-='0');
    long long ans=0;
    if(!L)ans=F(1,n)%P;
    for(int i=1,z=1,s=0,op=1;i<=m;++i)
    {
        z=233ll*z%P;
        s+=X+_[i],op&=_[i];
        int u=X+op+1,r=n-s;
        long long a=0;
        //solve white
        a=F(1,s)-F(1,s-i+1);
        //solve border,reduce some
        int k=min(2*i-2,r);r-=k;
        a+=F(i,i-1+k/2)+F(i,i-1+k-k/2);
        //solve mid and rst of border
        int x=r%u,d=r/u;
        a+=(u-x)*G(d,i)+x*G(d+1,i);
        // a+=1ll*(u-x)*(i*4-3+d)*d/2+1ll*x*(i*4-3+d+1)*(d+1)/2;
        a=F(1,n)-a;
        if(i>=L&&i<=R)ans^=1ll*(a%P)*z%P;
        // cerr<<i<<" : "<<a<<" "<<n<<" "<<ans<<endl;
    }
    cout<<ans<<endl;
}