#line 1 "/workspaces/compro/lib/template.hpp"


#line 1 "/workspaces/compro/lib/io/vector.hpp"
#include <iostream>
#include <vector>

#ifndef IO_VECTOR
#define IO_VECTOR

template <class T> std::ostream &operator<<(std::ostream &out, const std::vector<T> &v) {
  int size = v.size();
  for (int i = 0; i < size; i++) {
    std::cout << v[i];
    if (i != size - 1)
      std::cout << " ";
  }
  return out;
}

template <class T> std::istream &operator>>(std::istream &in, std::vector<T> &v) {
  for (auto &el : v) {
    std::cin >> el;
  }
  return in;
}

#endif
#line 4 "/workspaces/compro/lib/template.hpp"
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, m, n) for (int i = m; i < n; i++)
#define ALL(v) (v).begin(), (v).end()
#define coutd(n) cout << fixed << setprecision(n)
#define ll long long int
#define vl vector<ll>
#define vi vector<int>
#define MM << " " <<

using namespace std;

template <class T> void say(bool val, T yes, T no) { cout << (val ? yes : no) << "\n"; }

void say(bool val, string yes = "Yes", string no = "No") { say<string>(val, yes, no); }

template <class T> void chmin(T &a, T b) {
  if (a > b)
    a = b;
}

template <class T> void chmax(T &a, T b) {
  if (a < b)
    a = b;
}

// C++ 17に完全移行したら消す
// 最大公約数を求める
template <class T> T gcd(T n, T m) { return n ? gcd(m % n, n) : m; }

// 最小公倍数を求める
template <class T> T lcm(T n, T m) {
  T g = gcd(n, m);
  return (n / g) * m;
}

// 重複を消す。計算量はO(NlogN)
template <class T> void unique(std::vector<T> &v) {
  std::sort(v.begin(), v.end());
  v.erase(std::unique(v.begin(), v.end()), v.end());
}


#line 2 "main.cpp"

constexpr long long MOD = 998244353;
long long solve(long long N, int K, long long X, long long Y, const std::vector<long long> &A) {
  ll ans = 0;
  ll loop = 1;
  REP(i, N) { loop *= K; }
  REP(i, loop) {
    ll tmp = i;
    int x = 0;
    int prev = -1;
    bool ok = true;
    REP(i, N) {
      int idx = tmp % K;
      if (prev == A[idx]) {
        ok = false;
        break;
      }
      prev = A[idx];
      x = x ^ A[idx];
      tmp /= K;
    }
    if (ok && X <= x && x <= Y) {
      ans++;
    }
  }
  return ans;
}

// generated by online-judge-template-generator v4.7.1 (https://github.com/online-judge-tools/template-generator)
int main() {
  int N;
  long long K;
  long long X, Y;
  std::cin >> N >> K;
  std::vector<long long> A(K);
  std::cin >> X >> Y;
  for (int i = 0; i < K; ++i) {
    std::cin >> A[i];
  }
  auto ans = solve(N, K, X, Y, A);
  std::cout << ans << std::endl;
  return 0;
}