#include <bits/stdc++.h>

#define int long long

using namespace std;

const int MaxM = 1e7 + 10;

const int Mod = 998244353; 

int m, L, R, X;

char s[MaxM];

int t, z, k; 

int ans;

int getSum(int x, int y) {
   if (x + y < Mod) return x + y;
   else return x + y - Mod; 
}

int getDif(int x, int y) {
   if (x >= y) return x - y;
   else return x - y + Mod; 
}

int calc(int x) {
   return x * (1ll * x + 1) / 2 % Mod; 
}

int f(int i) {
   return getDif(i * (1ll * t - k + 1) % Mod, i * (1ll * i + 1) / 2 % Mod); 
}

int g(int i) {
   return getDif(i * (t - 2ll * k + 2) % Mod, i * (1ll * i + 1) / 2 % Mod); 
}

int solve() {
   //printf("z=%lld\n", z); 
   if (!k) return z * (1ll * z + 1) / 2 % Mod; 
   int l = min(z + 1, t / k);
   int res = getSum(calc(t - k + 1), calc(z));
   //printf("res=%lld\n", res); 
   if (z <= 2 * k - 2) {
	  int a = z / 2, b = z - a;
	  //printf("a=%lld b=%lld z=%lld\n", a, b, z); 
	  return getSum(res, getSum(f(a), f(b))); 
   }
   else {
	  int p = (z - 2 * k + 2) / (l + 1);
	  int a = (z - 2 * k + 2) % (l + 1), b = l + 1 - a;
	  for (int i = 1; i <= 2; ++i) {
		 if (a >= 1) res = getSum(res, f(p + k)), --a;
		 else if (b >= 1) res = getSum(res, f(p + k - 1)), --b; 
	  }
	  res = getSum(res, 1ll * a * g(p + 1) % Mod);
	  res = getSum(res, 1ll * b * g(p) % Mod);
	  return res; 
   }
}

signed main() {
   scanf("%lld %lld %lld %lld", &m, &L, &R, &X); 
   scanf("%s", s);
   for (int i = 0; i < m; ++i) {
	  z += X + (s[i] == '1');
   }
   int mul = 1; 
   for (int i = 0; i <= m; ++i) {
	  k = i; 
	  if (L <= i && i <= R) ans ^= 1ll * mul * solve() % Mod;
	  //printf("%lld %lld %lld %lld\n", k, t, z, solve()); 
	  mul = 1ll * mul * 233 % Mod;
	  z -= X + (s[i] == '1');
	  t += X + (s[i] == '1'); 
   }
   printf("%lld\n", ans); 
   return 0; 
}