#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,mod = 998244353;

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

ll ans,pw[MAXN];

ll C(ll x){return (x*(x-1)/2); }

int main(){
	ios::sync_with_stdio(false); cin.tie(0);

	cin>>m>>l>>r>>x>>s;

	pw[0] = 1;rep(i,1,m)pw[i] = pw[i-1] * 233%mod;
	rep(i,0,m-1)n += x+s[i]-'0';

	if(l==0)ans ^= C(n+1)%mod;

	ll p = 0; 
	rep(i,0,m-1){
		ll k = i+1;
		p += x+s[i]-'0';

		ll num = x; if(p == (x+1) * (i+1))num++;

		ll ret=C(n+1),R = n-p;
		ret -= p*(k-1)-C(k-1);

		auto F1 = [&](ll x){return C(x+1)+(k-1)*x;}; //分给两边
		auto F2 = [&](ll x){return C(x+1)+2*(k-1)*x;}; //分给中间

		if(R <= 2*(k-1)){ //全部分给两边
			ret -= F1(R/2) + F1(R-R/2);
		}else{	
			R -= 2*(k-1);
			ll v = R/(num+1),w = R % (num+1);

			if(w <= num-1){
				ret -= 2*F1(v+k-1);
				ret -= w * F2(v+1);
				ret -= (num-1-w) * F2(v);
			}else{
				ret -= (num-1) * F2(v+1);
				ret -= F1(v+k-1) + F1(v+k);
			}
		}	

		ret%=mod;
		if(l<=k && r>=k)ans ^= pw[k] * ret%mod;
	}
	cout<<ans<<endl;

    return 0;
}