#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 998244353;
using Mint = ModInt<MO>;


constexpr Int INF = 1001001001001001001LL;

/*
  (N-L) 0's, L 1's
  maximize # of intervals containing K 1's
  
  0^x[0] 1^y[0] 0^x[1] 1^y[1] ... 0^x[p-1] 1^y[p-1] 0^x[p]
  y[i] >= K  (looks good)
  
  bad intervals:
    0...0: \sum[0<=i<=p] x[i]*(x[i]+1)/2
    1...1: \sum[1<=k<=K-1] (L+1-k)  (fixed)
    0...1, 1...0: (K-1) x[0] + \sum[1<=i<=p-1] 2 (K-1) x[i] + (K-1) x[p]
  
  x[0], x[p]: almost same
  x[1], ..., x[p-1]: almost same
  maximize p
*/
Int slow(Int K, Int N, Int L) {
  assert(K <= L); assert(L <= N);
  if (K == 0) {
    return N * (N + 1) / 2;
  }
  auto costEnd = [&](Int x) -> Int {
    return x*(x+1)/2 + (K-1) * x;
  };
  auto costMid = [&](Int x) -> Int {
    return x*(x+1)/2 + 2 * (K-1) * x;
  };
  Int mn = INF;
  const Int p = L / K;
  if (p == 1) {
    const Int x0 = (N-L) / 2;
    const Int xp = (N-L) - x0;
    Int cost = 0;
    cost += costEnd(x0);
    cost += costEnd(xp);
    chmin(mn, cost);
  } else {
    // fix x[0] + x[p] = s
    for (Int s = 0; s <= N-L; ++s) {
      const Int x0 = s / 2;
      const Int xp = s - x0;
      const Int q = (N-L - s) / (p-1);
      const Int r = (N-L - s) % (p-1);
      Int cost = 0;
      cost += costEnd(x0);
      cost += costEnd(xp);
      cost += (p-1 - r) * costMid(q);
      cost += r * costMid(q+1);
      chmin(mn, cost);
    }
  }
  Int ret = N * (N + 1) / 2;
  ret -= (K-1) * (L + (L-K+2)) / 2;
  ret -= mn;
  return ret;
}

/*
  x[0] + x[1] + ... + x[p-1] + x[p] = N-L
  minimize f(x[0]) + g(x[1]) + ... + g(x[p-1]) + f(x[p])
  f(x) := x*(x+1)/2 + (K-1) x
  g(x) := x*(x+1)/2 + 2 (K-1) x
  
  f(x+1) - f(x) = x + K
  g(x+1) - g(x) = x + (2K-1)
*/
Int fast(Int K, Int N, Int L) {
  assert(K <= L); assert(L <= N);
  if (K == 0) {
    return N * (N + 1) / 2;
  }
  const Int p = L / K;
  Int cost = 0;
  auto f = [&](Int x) -> Int {
    return x*(x+1)/2 + (K-1) * x;
  };
  auto g = [&](Int x) -> Int {
    return x*(x+1)/2 + 2 * (K-1) * x;
  };
  if (N-L < 2 * (K-1)) {
    const Int x0 = (N-L) / 2;
    const Int xp = (N-L) - x0;
    cost += f(x0);
    cost += f(xp);
  } else {
    const Int lot = (N-L) - 2 * (K-1);
    const Int q = lot / (p + 1);
    const Int r = lot % (p + 1);
    cost += f((K-1) + q + ((0 < r) ? 1 : 0));
    cost += f((K-1) + q + ((1 < r) ? 1 : 0));
    cost += max(r - 2, 0LL) * g(q + 1);
    cost += (p-1 - max(r - 2, 0LL)) * g(q);
  }
  Int ret = N * (N + 1) / 2;
  ret -= (K-1) * (L + (L-K+2)) / 2;
  ret -= cost;
  return ret;
}

void stress() {
  constexpr int lim = 20;
  for (int k = 0; k <= lim; ++k) {
    printf("k = %2d\n", k);
    for (int n = k; n <= lim; ++n) {
      for (int l = k; l <= n; ++l) {
        int mx = -1;
        int pm = -1;
        for (int p = 0; p < 1 << n; ++p) if (__builtin_popcount(p) == l) {
          int cnt = 0;
          for (int i = 0; i < n; ++i) {
            int now = 0;
            for (int j = i; j < n; ++j) {
              now += (p >> j & 1);
              if (now >= k) ++cnt;
            }
          }
          if (chmax(mx, cnt)) {
            pm = p;
          }
        }
        const Int slw = slow(k, n, l);
        const Int fst = fast(k, n, l);
        printf("%2d %2d %2d: %3d %3lld %3lld ", k, n, l, mx, slw, fst);
        for (int i = 0; i < n; ++i) printf("%d", pm >> i & 1);
        puts("");
        assert(mx == slw);
        assert(mx == fst);
      }
    }
    fflush(stdout);
  }
}


int M, L, R;
Int X, N;
char S[10'000'010];

int main() {
  // stress(); return 0;
  
  for (; ~scanf("%d%d%d%lld", &M, &L, &R, &X); ) {
    scanf("%s", S);
    N = M * X + count(S, S + M, '1');
cerr<<"M = "<<M<<", N = "<<N<<endl;
    
    vector<Int> ans(M + 1, 0);
    Int sum = 0;
    for (int k = 0; ; ++k) {
      ans[k] = fast(k, N, sum);
      if (k == M) break;
      sum += X + (S[k] - '0');
    }
// cerr<<"ans = "<<ans<<endl;
    
    unsigned key = 0;
    Mint wt = Mint(233).pow(L);
    for (int k = L; k <= R; ++k) {
      key ^= (wt * ans[k]).x;
      wt *= 233;
    }
    printf("%u\n", key);
  }
  return 0;
}