#include<bits/stdc++.h>
#define rep(i, n) for(int i = 0; i < n; ++i)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
const int Mod = 998244353;
inline int sign(int a){ return a&1 ? Mod-1 : 1; }
inline void uadd(int &a, int b){ a += b-Mod; a += (a>>31) & Mod; }
inline void usub(int &a, int b){ a -= b; a += (a>>31) & Mod; }
inline void umul(int &a, int b){ a = (int)(1ll*a*b % Mod); }
inline int add(int a, int b){ return (a+b >= Mod) ? a+b-Mod : a+b; }
inline int sub(int a, int b){ return (a-b < 0) ? a-b+Mod : a-b; }
inline int mul(int a, int b){ return (int)(1ll*a*b % Mod); }
int qpow(int b, ll p){ int ret = 1; while(p){ if(p&1) umul(ret, b); umul(b, b), p >>= 1; } return ret; }

/////////////////////////////////////////////////////////////////////////////////////////////////////////

int m, l, r, X;
int n;
ll N;
string str;
int presum[10000100];

int main(){
	//freopen("seq.in", "r", stdin);
	//freopen("seq.out", "w", stdout);
	ios::sync_with_stdio(false);

	cin >> m >> l >> r >> X >> str;
	rep(i, m)
		presum[i+1] = presum[i] + (str[i] == '1');
	n = m * X + presum[m];
	N = 1ll * n * (n+1) / 2;
	bool all1 = 1;
	ll has = 0;
	int res = 0, pw = 1;
	for(int i = 0; i < l; ++i){
		all1 &= (str[i] == '1'), has += X + (str[i] == '1');
		umul(pw, 233);
	}
	for(int i = l; i <= r; ++i){
		ll ans;
		if(i == 0)
			ans = N;
		else {
			int x = X + all1;
			ll S = n - has;
			ans = 1ll * i * (i-1) * (x-1) + 1ll * i * (i+1) / 2 - 1;
			//cout << ans << endl;
			if(!all1)
				ans += 1ll * presum[i] * (i-1); // presum[i+1]  ->  presum[i]
			//cout << ans << endl;
			
			ans += 2ll * S * (i-1);
			//cout << ans << endl;

			ll val = (S + 1ll * (x-1) * (i-1)) / (x+1);
			//cout << " " << S << ": " << val << " " << ans << endl;
			if(x == 1){
				ll rval = S - val;
				ans += 1ll * val * (val+1) / 2 + 1ll * rval * (rval+1) / 2;
				ans -= 1ll * (i-1) * (val + rval);
			} else {
				if(S <= val + val)
					val = S / 2;
				ll nS = S - val - val;
				ll nans = ans, pans = ans; ans = N+10; // add pans to recover nans
				
				nans += 1ll * val * (val+1) / 2 + 1ll * val * (val+1) / 2;
				ll nval0 = nS / (x-1), nval1 = (nS + (x-1) - 1) / (x-1), c1 = nS % (x-1);
				nans += 1ll * nval0 * (nval0+1) / 2 * (x-1 - c1);
				nans += 1ll * nval1 * (nval1+1) / 2 * (c1);
				nans -= 1ll * (i-1) * (val + val);
				//cout << "   " << val << " " << val << ": " << nans << "\n";
				ans = min(ans, nans);
				
				if(val + val+1 <= S){
					nans = pans;
					nS = S - val - (val+1);
					nans += 1ll * val * (val+1) / 2 + 1ll * (val+1) * ((val+1)+1) / 2;
					nval0 = nS / (x-1), nval1 = (nS + (x-1) - 1) / (x-1), c1 = nS % (x-1);
					nans += 1ll * nval0 * (nval0+1) / 2 * (x-1 - c1);
					nans += 1ll * nval1 * (nval1+1) / 2 * (c1);
					nans -= 1ll * (i-1) * (val + (val+1));
					//cout << "   " << val << " " << val+1 << ": " << nans << "\n";
					ans = min(ans, nans);
				}
				
				if(val+1 + val+1 <= S){
					nans = pans;
					nS = S - (val+1) - (val+1);
					nans += 1ll * (val+1) * ((val+1)+1) / 2 + 1ll * (val+1) * ((val+1)+1) / 2;
					nval0 = nS / (x-1), nval1 = (nS + (x-1) - 1) / (x-1), c1 = nS % (x-1);
					nans += 1ll * nval0 * (nval0+1) / 2 * (x-1 - c1);
					nans += 1ll * nval1 * (nval1+1) / 2 * (c1);
					nans -= 1ll * (i-1) * ((val+1) + (val+1));
					//cout << "   " << val+1 << " " << val+1 << ": " << nans << "\n";
					ans = min(ans, nans);
				}
			}

			ans = N - ans;
		}
		
		//cout << i << ": " << ans << endl;
		res ^= mul(pw, (int)(ans % Mod));
		umul(pw, 233);
		has += X + (str[i] == '1'), all1 &= (str[i] == '1');
	}
	cout << res << "\n";
	
	return 0;
}