//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <utility>
#include <vector>

namespace n91 {

using i8 = std::int_fast8_t;
using i32 = std::int_fast32_t;
using i64 = std::int_fast64_t;
using u8 = std::uint_fast8_t;
using u32 = std::uint_fast32_t;
using u64 = std::uint_fast64_t;
using isize = std::ptrdiff_t;
using usize = std::size_t;

struct rep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { ++i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
struct revrep {
  struct itr {
    usize i;
    constexpr itr(const usize i) noexcept : i(i) {}
    void operator++() noexcept { --i; }
    constexpr usize operator*() const noexcept { return i; }
    constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
  };
  const itr f, l;
  constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
  constexpr auto begin() const noexcept { return f; }
  constexpr auto end() const noexcept { return l; }
};
template <class T> auto md_vec(const usize n, const T &value) {
  return std::vector<T>(n, value);
}
template <class... Args> auto md_vec(const usize n, Args... args) {
  return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
}
template <class T> constexpr T difference(const T &a, const T &b) noexcept {
  return a < b ? b - a : a - b;
}
template <class T> void chmin(T &a, const T &b) noexcept {
  if (b < a)
    a = b;
}
template <class T> void chmax(T &a, const T &b) noexcept {
  if (a < b)
    a = b;
}
template <class F> class rec_lambda {
  F f;

public:
  rec_lambda(F &&f) : f(std::move(f)) {}
  template <class... Args> auto operator()(Args &&... args) const {
    return f(*this, std::forward<Args>(args)...);
  }
};
template <class F> auto make_rec(F &&f) { return rec_lambda<F>(std::move(f)); }
template <class T> T scan() {
  T ret;
  std::cin >> ret;
  return ret;
}
constexpr char eoln = '\n';
template <class T> T ceildiv(const T &l, const T &r) {
  return l / r + (l % r != 0 ? 1 : 0);
}

} // namespace n91

#include <cstdint>

constexpr bool parity32(std::uint_fast32_t c) noexcept {
  c ^= c >> 1;
  c ^= c >> 2;
  return ((c & 0x11111111) * 0x11111111 >> 28 & 0x1) != 0;
}

namespace n91 {

constexpr bool get(const usize x, const usize i) { return x >> i & 1; }

#include <vector>

void superset_zeta_transform(std::vector<usize> &a) {
  const usize n = a.size();
  for (usize i = 1; i < n; i *= 2) {
    for (usize j = 0; j != n; j += 1) {
      if ((j & i) != 0)
        a[j & ~i] += a[j];
    }
  }
}

static constexpr usize bitlen = 28;

void solve(const std::vector<usize> a, const usize k, const usize bitlent) {
  const usize n = a.size();

  u64 ans = 0;

  auto comb = md_vec(n + 1, k, u64(0));
  std::vector<u64> sel(n + 1, 0);
  for (const usize i : rep(0, n + 1)) {
    for (const usize j : rep(0, k)) {
      if (i < j) {
        comb[i][j] = 0;
      } else if (j == 0 || i == j) {
        comb[i][j] = 1;
      } else {
        comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
      }
    }
    for (const usize j : rep(0, k)) {
      sel[i] += comb[i][j];
    }
  }

  std::vector<int> par(1 << bitlent);
  for (const usize i : rep(0, 1 << bitlent)) {
    par[i] = parity32(i);
  }

  for (const usize i : rep(0, n)) {
    std::vector<usize> s(1 << bitlent, 0);
    const usize mask = (1 << bitlent) - 1;
    for (const usize j : rep(i + 1, n)) {
      s[mask ^ a[i] ^ a[j]] += 1;
    }
    superset_zeta_transform(s);
    for (const usize k : rep(0, 1 << bitlent)) {
      const u64 c = sel[s[k]];
      if (par[k]) {
        ans -= c;
      } else {
        ans += c;
      }
    }
  }

  std::cout << ans << eoln;
}

void main_() {
  /*
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  //*/
  const usize n = scan<usize>();
  const usize k = scan<usize>();
  const usize s = scan<usize>();
  const usize t = scan<usize>();
  if ((s & ~t) != 0) {
    std::cout << 0 << eoln;
    return;
  }
  std::vector<usize> a(n);
  for (auto &e : a) {
    std::cin >> e;
  }
  std::vector<usize> b;
  usize count = 0;
  for (const auto e : a) {
    bool f = true;
    usize c = 0;
    usize r = 0;
    for (const usize i : rep(0, bitlen)) {
      if (get(s, i) && !get(e, i)) {
        f = false;
      }
      if (!get(t, i) && get(e, i)) {
        f = false;
      }
      if (get(s, i) || !get(t, i)) {
        continue;
      }
      if (get(e, i)) {
        r |= 1 << c;
      }
      c += 1;
    }
    count = c;
    if (f) {
      b.push_back(r);
    }
  }
  solve(b, k, count);
}

} // namespace n91

int main() {
  n91::main_();
  return 0;
}


Measured memory_bytes: 6432