#include <bits/stdc++.h>
#define pii pair <int , int>
#define pll pair <LL , LL>
#define mp make_pair
#define fs first
#define sc second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;

//const int Mxdt=100000;
//static char buf[Mxdt],*p1=buf,*p2=buf;
//#define getchar() p1==p2&&(p2=(p1=buf)+fread(buf,1,Mxdt,stdin),p1==p2)?EOF:*p1++;

template <typename T>
void read(T &x) {
	T f=1;x=0;char s=getchar();
	while(s<'0'||s>'9') {if(s=='-') f=-1;s=getchar();}
	while(s>='0'&&s<='9') {x=(x<<3)+(x<<1)+(s^'0');s=getchar();}
	x *= f;
}

template <typename T>
void write(T x , char s='\n') {
	if(!x) {putchar('0');putchar(s);return;}
	if(x<0) {putchar('-');x=-x;}
	T t = 0 , tmp[25] = {};
	while(x) tmp[t ++] = x % 10 , x /= 10;
	while(t -- > 0) putchar(tmp[t] + '0');
	putchar(s);
}

const int MAXN = 1e7 + 5;
const int mod = 998244353;

inline int Add(int x , int y) {x += y;return x >= mod?x - mod:x;}
inline int Sub(int x , int y) {x -= y;return x < 0?x + mod:x;}
inline int Mul(int x , int y) {return 1ll * x * y % mod;}

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

int main() {
	read(m),read(l),read(r),read(X);
	scanf("%s" , s);
	
	for (int i = 0; i < m; ++i) {
		n += X + (s[i] - '0');
	}
	
	int Tot = Mul(Mul(n , n + 1) , (mod + 1) >> 1);
	int ans = 0 , B = 1 , cnt = 0;
	if(!l) l ++ , ans = Tot;
	for (int i = 0; i < l; ++i) cnt += X + (s[i] - '0') , n -= (X + (s[i] - '0')) , B = Mul(B , 233);
	
	for (int i = l; i <= r; ++i , B = Mul(B , 233)) {
		int p = cnt / i + 1;
		int cur = Add(Mul(cnt - i + 1 , i - 1) , Mul(Mul(i , i - 1) , (mod + 1) >> 1));
		// white balls and white balls (illegal)
		
		if(n >= (i - 1) * 2) {
			int lr = i - 1;
			int res = (n - lr * 2) / p , ad = n - lr * 2 - res * p;
			cur = Add(cur , Mul(Mul(res , res + 1) , Mul(p - 2 - min(ad , p - 2) , (mod + 1) >> 1)));
			cur = Add(cur , Mul(Mul(res + 1 , res + 2) , Mul(min(ad , p - 2) , (mod + 1) >> 1)));
			cur = Add(cur , Mul(Mul(lr + res + (ad >= p - 1) , lr + (ad >= p - 1) + res + 1) , (mod + 1) >> 1));
			cur = Add(cur , Mul(Mul(lr + res , lr + res + 1) , (mod + 1) >> 1));
			cur = Add(cur , Mul(n - lr * 2 - res * 2 - (ad >= p - 1) , 2 * i - 2));
			cur = Add(cur , Mul(lr * 2 + res * 2 + (ad >= p - 1) , i - 1));
		}
		else {
			int lr = n / 2 , rr = n - lr;
			cur = Add(cur , Mul(Mul(lr , lr + 1) , (mod + 1) >> 1));
			cur = Add(cur , Mul(Mul(rr , rr + 1) , (mod + 1) >> 1));
			cur = Add(cur , Mul(n , i - 1));
		}
		
		// other cases (illegal)
		
//		write(Sub(Tot , cur));
		ans ^= Mul(B , Sub(Tot , cur));
		cnt += X + (s[i] - '0');
		n -= (X + (s[i] - '0'));
	}
	
	write(ans);
	
	return 0;
}