#include <bits/stdc++.h>
using namespace std;
const int N = 1e7 + 10, mod = 998244353;
int n, m, l, r, X, a[N], s[N];
char _s[N];
#define chkmod(x) (((x) >= mod) && ((x) -= mod))
int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    cin >> m >> l >> r >> X >> _s;
    for (int i = 0; i < m; i++) a[i] = X + _s[i] - '0', s[i] = (i == 0 ? 0 : s[i - 1]) + a[i];
    n = s[m - 1];
    auto calc = [](int l, int r) { return 1ll * (l + r) * (r - l + 1) / 2 % mod; };

    int ans = l == 0 ? calc(1, n) : 0;
    for (int i = 1, pw = 233, mi = a[0]; i <= r; i++, pw = pw * 233ll % mod) {
        int res = calc(1, n), hs = n - s[i - 1], c0 = min(2 * (i - 1), hs), c1 = hs - c0;
        res += mod - calc(s[i - 1] - i + 2, s[i - 1]), chkmod(res);

        res += mod - calc(i, i + (c0 / 2) - 1), chkmod(res);
        res += mod - calc(i, i + (c0 - c0 / 2) - 1), chkmod(res);

        int x = c1 / (mi + 1), y = c1 % (mi + 1);
        res += mod - 1ll * calc(2 * i - 1, 2 * i + x - 2) * (mi + 1) % mod, chkmod(res);
        res += mod - 1ll * (2 * i + x - 1) * y % mod, chkmod(res);

        if (i >= l) ans ^= 1ll * pw * res % mod;
        mi = min(mi, a[i]);
    }
    cout << ans << '\n';
    return 0;
}