#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 5;
const int mod = 998244353;
const int inv = 499122177;

int m, l, r, X, suf[N], pre[N], ans;
char s[N];

int main() {
	scanf("%d%d%d%d", &m, &l, &r, &X);
	scanf("%s", s);
	for (int i = 0; i < m; ++i) {
		if (i) pre[i] = pre[i - 1];
		pre[i] += s[i] - '0';
	}
	for (int i = m - 1; i >= 0; --i) {
		if (i + 1 < m) suf[i] = suf[i + 1];
		suf[i] += X + s[i] - '0';
	}
	int pw = 1, all = 1ll * (suf[0] % mod) * ((suf[0] + 1) % mod) % mod * inv % mod;
	for (int i = 1; i <= l; ++i) pw = 233ll * pw % mod;
	for (int i = l; i <= r; ++i, pw = 233ll * pw % mod) {
		if (i == 0) {
			ans ^= 1ll * all * pw % mod;
			continue;
		}
		int res = all;
		int L = (suf[i] + 1) / 2;
		int R = suf[i] / 2;
		res = (res - 1ll * L * (L + 1) % mod * inv % mod + mod) % mod;
		res = (res - 1ll * R * (R + 1) % mod * inv % mod + mod) % mod;
		res = (res - 1ll * (i - 1) * L % mod + mod) % mod;
		res = (res - 1ll * (i - 1) * R % mod + mod) % mod;
		int len = suf[0] - suf[i];
		int p = i - 1;
		res = (res - 1ll * (len - p + 1) * p % mod + mod) % mod;
		res = (res - 1ll * (p - 1) * p % mod * inv % mod + mod) % mod;
		ans ^= 1ll * res * pw % mod;
	}
	printf("%d\n", ans);
	return 0;
}