#include <bits/stdc++.h>
#define ll long long
#define pii pair <int, int>
#define fi first
#define se second
#define pb push_back
#define int long long

using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
const int N = 1e7+5, inf = 0x3f3f3f3f3f3f3f3f, mod = 998244353; 
int m, L, R, x, n;   
string str; 

inline int sum (int n) { return n*(n+1)/2; }
inline int gets (int k, int c) {
	return sum(k/c)*c+(k/c+1)*(k%c);  
}
inline int gv (int i, int sl, int cx, int j) {
	return -j*i+gets(j, 2)+gets(sl-j, cx-1); 
}

void solve () {
	cin >> m >> L >> R >> x >> str; 
	n = m*x; 
	for (int i = 0;i < m;i++) {
		n += str[i]-'0'; 
	}
	int lt = 1, res = 0, k = 0;
	if (L == 0) res ^= sum(n)%mod;
	int z = 2e7; 
	for (int i = 0;i < m;i++) {
		lt = lt*233%mod; 
		if (str[i] == '1') k++; 
		int ans = 0, sl, cx; 
		if (k == i+1) {
			sl = n-(i+1)*(x+1); cx = x+1;  
		}
		else {
			sl = n-(i+1)*x-k; cx = x; 
			ans += k*i; 
		}
		int sv; 
		z += 5; 
		z = min(z, sl); 
		if (cx > 1) {
			if (i <= k) {
				int l = 0, r = sl; 
				while (l < r) {
					int mid = l+r+1>>1; 
					if (gv(i, sl, cx, mid)-gv(i, sl, cx, mid-1) < 0) l = mid; 
					else r = mid-1; 
				}
				sv = gv(i, sl, cx, l);
			}
			else {
				while (z > 0 && gv(i, sl, cx, z-1) < gv(i, sl, cx, z)) z--; 
				sv = gv(i, sl, cx, z); 
			}
////			cout << l << endl;
//			if (gv(i, sl, cx, z) != gv(i, sl, cx, l)) {
//				cout << l << " " << z << endl; 
//			} 
//			assert(gv(i, sl, cx, z) == gv(i, sl, cx, l)); 
//			for (int j = 0;j <= sl;j++) cout << gv(i, sl, cx, j) << " "; cout << endl; 
//			cerr << l << " " << z << " " << gv(i, sl, cx, l) << " " << gv(i, sl, cx, z) << endl; 
//			return; 
		}
		else sv = -sl*i+gets(sl	, 2); 
		ans += sv+2*i*sl+i*(i+1)*(cx-1)+sum(i)+i;
		ans = sum(n)-ans; 
		if (L <= i+1 && i+1 <= R) res ^= ans%mod*lt%mod; 
	}
	cout << res; 
}

signed main () {
//	freopen("t.in", "r", stdin); 
//	freopen("t.out", "w" ,stdout); 
//	ios::sync_with_stdio(0);
//	cin.tie(0); cout.tie(0);	
	int T = 1; //cin >> T;
	while (T--) solve();
	return 0;
}