#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<ctime>
#include<random>
#include<assert.h>
#define pb emplace_back
#define mp make_pair
#define fi first
#define se second
#define dbg(x) cerr<<"In Line "<< __LINE__<<" the "<<#x<<" = "<<x<<'\n'
#define dpi(x,y) cerr<<"In Line "<<__LINE__<<" the "<<#x<<" = "<<x<<" ; "<<"the "<<#y<<" = "<<y<<'\n'
#define DE(fmt,...) fprintf(stderr, "Line %d : " fmt "\n",__LINE__,##__VA_ARGS__)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int>pii;
typedef pair<ll,int>pli;
typedef pair<ll,ll>pll;
typedef pair<int,ll>pil;
typedef vector<int>vi;
typedef vector<ll>vll;
typedef vector<pii>vpii;
typedef vector<pll>vpll;
template<typename T>T cmax(T &x, T y){return x=x>y?x:y;}
template<typename T>T cmin(T &x, T y){return x=x<y?x:y;}
template<typename T>
T &read(T &r){
	r=0;bool w=0;char ch=getchar();
	while(ch<'0'||ch>'9')w=ch=='-'?1:0,ch=getchar();
	while(ch>='0'&&ch<='9')r=r*10+(ch^48),ch=getchar();
	return r=w?-r:r;
}
template<typename T1,typename... T2>
void read(T1 &x,T2& ...y){read(x);read(y...);}
const int mod=998244353;
inline void cadd(int &x,int y){x=(x+y>=mod)?(x+y-mod):(x+y);}
inline void cdel(int &x,int y){x=(x-y<0)?(x-y+mod):(x-y);}
inline int add(int x,int y){return (x+y>=mod)?(x+y-mod):(x+y);}
inline int del(int x,int y){return (x-y<0)?(x-y+mod):(x-y);}
int qpow(int x,int y){
	int s=1;
	while(y){
		if(y&1)s=1ll*s*x%mod;
		x=1ll*x*x%mod;
		y>>=1;
	}
	return s;
}
const int N=10000010;
ll n,m,l,r,c;
int pre[N];
char str[N];
ll dbh(ll l,ll r){
	if(l>r)return 0;
	return (l+r)*(r-l+1);
}
ll solve(ll k){
	if(k==0)return n*(n+1)/2%mod;
	ll ans=(n-k+2)*(n-k+1)/2%mod;
	ll r=n-k*c-pre[k];
	if(k==1){
		int ct=c+1;
		if(pre[k]==k)++ct;
		int cs=r/ct;
		ans-=1ll*dbh(1,1+cs-1)%mod*((mod+1)/2)%mod*ct%mod;
		ans=(ans+mod)%mod;
		r-=cs*ct;
		ans-=r%mod*(1+cs)%mod;
		ans=(ans+mod)%mod;
		return ans;
	}
	ll t=min(2*(k-1),r);
	ans-=dbh(1,t/2)%mod;
	if(t&1)ans-=(1+t/2)%mod;
	ans=(ans+mod)%mod;
	r-=t;
	int ct=c+1;
	if(pre[k]==k)++ct;
	int cs=r/ct;
	ans-=dbh(k,k+cs-1)%mod*((mod+1)/2)%mod*ct%mod;
	ans=(ans+mod)%mod;
	r-=cs*ct;
	ans-=r%mod*(k+cs)%mod;
	ans=(ans+mod)%mod;
	return ans;
}
signed main(){
	read(m,l,r,c);
	scanf("%s",str+1);
	n=1ll*m*c;
	for(int i=1;i<=m;i++)pre[i]=pre[i-1]+str[i]-'0';
	n+=pre[m];
	int coef=qpow(233,l),su=0;
	for(int k=l;k<=r;k++){
		int s=solve(k);
//		dbg(s);
		su^=1ll*coef*s%mod;
		coef=coef*233ll%mod;
	}
	cout<<su<<'\n';
    #ifdef do_while_true
//		cerr<<'\n'<<"Time:"<<1.0*clock()/CLOCKS_PER_SEC*1000<<" ms"<<'\n';
	#endif
	return 0;
}