#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN=1e7+10,LIM=1e7,mod=998244353;
void add(int& x,int y){x=(x+y)%mod;}
void sub(int& x,int y){x=(x-y+mod)%mod;}

int pw[MAXN];
int n,m,l,r,x,ans,cnt;
char s[MAXN];

ll C(ll n){
	return n*(n+1)/2;
}

int solve(ll k){
	if(k==0)return C(n)%mod;
	int num;
	ll all=C(n);

	if(cnt!=k)num=x;
	else num=x+1;
	
	all-=(C(k*x+cnt)-C(k*(x-1)+cnt+1));

	int rest=n-k*x-cnt;

	if(rest < 2*(k-1)){
		int L=rest/2,R=rest-L; //左边界L个，右边界R个
		all-=( C(L)+C(R)+rest*(k-1) );

	}else{
		rest-=2*(k-1);
		int L=k-1,R=k-1;
		int rv=rest/(num+1);
		int rcnt=min(num-1,rest%(num+1));
		L+=rv,R+=rv;
		if(rest%(num+1) >= num)L++;
		//左边界L个，右边界R个，中间部分rcnt个取rv+1，num-1-rcnt个取rv

		all-=(C(L)+C(R)+C(rv+1)*rcnt+C(rv)*(num-1-rcnt));
		all-=((L+R)*(k-1) + (rcnt*(rv+1)+(num-1-rcnt)*rv)*(2*k-2));
	}

	return all%mod;
}
int main(){
	pw[0]=1;rep(i,1,LIM)pw[i]=1ll*pw[i-1]*233%mod;

	ios::sync_with_stdio(false);
	cin>>m>>l>>r>>x>>s;
	n=m*x;rep(i,0,m-1)n+=(s[i]=='1');

	rep(i,0,l-1)cnt+=(s[i]=='1');
	rep(i,l,r){
		int val=solve(i);
		
		val=1ll*val*pw[i]%mod;
		ans^=val;
		
		cnt+=(s[i]=='1');
	}
	cout<<ans<<endl;

    return 0;
}