#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int N=1e7+5,mod=998244353;
char c[N];
int l,r,X;
int ans;
ll n,m,pw=1,res,pre,suf,cnt;
ll calc(ll l,ll r){return (l+r)*(r-l+1)/2;}
signed main(){
  ios::sync_with_stdio(0);
  cin.tie(0),cout.tie(0);
  cin>>m>>l>>r>>X>>(c+1);
  for(int i=1;i<=m;i++)n+=X+c[i]-'0';
  if(l==0)ans^=n*(n+1)/2%mod;
  for(int i=1;i<=r;i++){
    pw=pw*233%mod;
    pre+=X+c[i]-'0',suf=n-pre;
    res=0;
    cnt=(pre==(X+1)*i?X+1:X);
    res+=calc(1,pre-i+1);
    if(suf<=2*(i-1))res+=calc(pre,n-1)-2*calc(i-1,i-1+suf/2-1)-suf%2*(i-1+suf/2);
    else{
      ll len=pre;
      res+=calc(len,len+2*(i-1)-1)-2*calc(i-1,2*i-3);
      len+=2*(i-1),suf-=2*(i-1);
      res+=calc(len,n-1)-(cnt+1)*calc(2*(i-1),2*(i-1)+suf/(cnt+1)-1)-suf%(cnt+1)*(2*(i-1)+suf/(cnt+1));
    }
    res=res%mod*pw%mod;
    if(i>=l)ans^=res;
  }
  cout<<ans<<'\n';
  return 0;
}