#include <bits/stdc++.h>
using namespace std;
#define For(Ti,Ta,Tb) for(auto Ti=(Ta);Ti<=(Tb);++Ti)
#define Dec(Ti,Ta,Tb) for(auto Ti=(Ta);Ti>=(Tb);--Ti)
#define debug(...) fprintf(stderr,__VA_ARGS__)
#define range(Tx) begin(Tx),end(Tx)
using ll=long long;
using i128=__int128;
const int M=1e7+5,Mod=998244353;
const ll Inv2=(Mod+1)/2;
int m,l,r,cnt;
char s[M];
ll sum(ll l,ll r){
	if(l>r) return 0;
	return ((l+r)%Mod)*((r-l+1)%Mod)%Mod*Inv2%Mod;
}
int main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	cin>>m>>l>>r>>cnt>>s;
	ll cur=cnt+s[0]-'0',n=1LL*m*cnt+count(s,s+m,'1'),pw=1,Ans=0;
	For(i,1,l-1){
		cur+=cnt+s[i]-'0';
	}
	For(i,1,l){
		(pw*=233)%=Mod;
	}
	if(!l){
		Ans=sum(1,n);
		(pw*=233)%=Mod;
	}
	For(k,max(1,l),r){
		ll c=cur/k+1;
		i128 ans=sum(cur-2*(k-1),n-1-2*(k-1))+sum(1,cur-k+1);
		if(n-cur<=2*(k-1)){
			ll x1=(n-cur)/2,x2=(n-cur+1)/2;
			ans+=i128(k-1)*(n-cur)-sum(0,x1-1)-sum(0,x2-1);
		}else{
			ll left=n-cur-2*(k-1);
			ans+=sum(1,k-1)*2;
			ans-=i128(sum(1,left/c-1))*(c-left%c)+i128(sum(1,left/c))*(left%c);
		}
		ans=(ans%Mod+Mod)%Mod;
		Ans^=pw*ans%Mod;
		cur+=cnt+s[k]-'0';
		(pw*=233)%=Mod;
	}
	cout<<Ans<<'\n';
	return 0;
}