#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;

// block size >= K
Int dp[210][210];
Int calc(Int K, Int N, Int L) {
  if (K == 0) {
    return N * (N + 1) / 2;
  }
  for (Int i = 0; i <= N - K; ++i) {
    fill(dp[i], dp[i] + (L + 1), -INF);
  }
  for (int i = 0; i <= N - K; ++i) {
    chmax(dp[i][K], (i + 1) * (N - (i+K) + 1));
  }
  for (int i = 0; i < N - K; ++i) {
    for (int j = 0; j < L; ++j) {
      // extend
      chmax(dp[i + 1][j + 1], dp[i][j] + (N - (i+K+1) + 1));
      // skip
      if (j + K <= L) {
        for (Int ii = i + K + 1; ii <= N - K; ++ii) {
          // +[*,ii+1), ..., +[*,ii+K-1); +[ii,ii+K); -[i+K-1,ii+K)
          chmax(dp[ii][j + K], dp[i][j] + (K-1) * ((N - (ii+1) + 1) + (N - (ii+K-1) + 1)) / 2 + (ii + 1) * (N - (ii+K) + 1) - ((i+K-1) + 1) * (N - (ii+K) + 1));
        }
      }
    }
  }
  Int ret = -INF;
  for (int i = 0; i <= N - K; ++i) {
    chmax(ret, dp[i][L]);
  }
  return ret;
}

void experiment() {
  for (int k = 0; k <= 16; ++k) {
    printf("k = %2d\n", k);
    for (int n = k; n <= 16; ++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 res = calc(k, n, l);
        printf("%2d %2d: %3d %3lld ", n, l, mx, res);
        for (int i = 0; i < n; ++i) printf("%d", pm >> i & 1);
        puts("");
        assert(mx == res);
      }
    }
    fflush(stdout);
  }
}


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


namespace brute {
vector<Int> run() {
  vector<int> as;
  for (int a = 0; a < M; ++a) {
    for (int x = 0; x < X + (S[a] - '0'); ++x) {
      as.push_back(a);
    }
  }
  vector<Int> ans(M + 1, 0);
  vector<vector<int>> opt(M + 1);
  do {
    vector<Int> cnt(M + 1, 0);
    for (int i = 0; i < N; ++i) {
      int app = 0;
      for (int j = i; j < N; ++j) {
        app |= 1 << as[j];
        ++cnt[__builtin_ctz(~app)];
      }
    }
    for (int k = M; --k >= 0; ) {
      cnt[k] += cnt[k + 1];
    }
    for (int k = L; k <= R; ++k) {
      if (chmax(ans[k], cnt[k])) {
        opt[k] = as;
      }
    }
  } while (next_permutation(as.begin(), as.end()));
for(int k=L;k<=R;++k)cerr<<k<<": "<<ans[k]<<"; "<<opt[k]<<endl;
  return ans;
}
}  // brute


namespace sub4 {
vector<Int> run() {
  vector<Int> ans(M + 1, 0);
  ans[0] = N * (N + 1) / 2;
  ans[1] = N * (N + 1) / 2 - ((1 < M) ? (X + (S[1] - '0')) : 0);
  return ans;
}
}  // sub4


namespace sub5 {
vector<Int> run() {
  vector<Int> ans(M + 1, 0);
  ans[M] = N * (N + 1) / 2;
  for (int i = 1; i < M; ++i) {
    ans[M] -= (N + 1 - i);
  }
  return ans;
}
}  // sub5


namespace sub6 {
vector<Int> run() {
  vector<Int> ans(M + 1, 0);
  for (int k = L; k <= R; ++k) {
    if (k) {
      const Int nL = (N - k) / 2;
      const Int nR = (N - k) - nL;
      ans[k] = (nL + 1) * (nR + 1);
    } else {
      ans[k] = N * (N + 1) / 2;
    }
  }
  return ans;
}
}  // sub6


namespace slow {
vector<Int> run() {
  vector<Int> pre(M + 1, 0);
  for (int a = 0; a < M; ++a) {
    pre[a + 1] = pre[a] + (X + (S[a] - '0'));
  }
  vector<Int> ans(M + 1, 0);
  for (int k = L; k <= R; ++k) {
    ans[k] = calc(k, N, pre[k]);
  }
  return ans;
}
}  // slow


int main() {
  // experiment(); 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;
    if (M <= 2 && L == 0 && R == 1) {
cerr<<"sub4"<<endl;
      ans = sub4::run();
    } else if (L == M && R == M) {
cerr<<"sub5"<<endl;
      ans = sub5::run();
    } else if (N == M) {
cerr<<"sub6"<<endl;
      ans = sub6::run();
    } else if (N <= 200) {
cerr<<"slow"<<endl;
      ans = slow::run();
    } else {
      assert(false);
    }
cerr<<"ans = "<<ans<<endl;
#ifdef LOCAL
if(N<=9){
 const auto brt=brute::run();
 if(brt!=ans){
  cerr<<"M = "<<M<<", L = "<<L<<", R = "<<R<<", X = "<<X<<", N = "<<N<<", S = "<<S<<endl;
  cerr<<"brt = "<<brt<<endl;
  cerr<<"ans = "<<ans<<endl;
 }
 assert(brt==ans);
}
#endif
    
    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;
}