#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;
// const int mod = 998244353;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

/**
 * @brief Binomial-Table(二項係数テーブル)
 * @docs docs/binomial-table.md
 */
template< typename T >
vector< vector< T > > binomial_table(int N) {
  vector< vector< T > > mat(N + 1, vector< T >(N + 1));
  for(int i = 0; i <= N; i++) {
    for(int j = 0; j <= i; j++) {
      if(j == 0 || j == i) mat[i][j] = 1;
      else mat[i][j] = mat[i - 1][j - 1] + mat[i - 1][j];
    }
  }
  return mat;
}

int main() {
  int N, K, S, T;
  cin >> N >> K >> S >> T;
  vector< int > A(N);
  cin >> A;


  auto C = binomial_table< int64 >(N);
  for(int i = 0; i < C.size(); i++) {
    C[i][0] = 0;
    for(int j = 1; j < C.size(); j++) C[i][j] += C[i][j - 1];
  }

  vector< vector< int > > stock;
  vector< int > tap;
  {
    vector< int > alive(N, true);
    for(int i = 17; i >= 0; i--) {
      int x = (S >> i) & 1;
      if(x == 1) { // 0のものは使えない
        for(int j = 0; j < N; j++) {
          if((~A[j] >> i) & 1) alive[j] = false;
        }
      }
      int y = (T >> i) & 1;
      if(y == 0) { // 1のものは使えない
        for(int j = 0; j < N; j++) {
          if((A[j] >> i) & 1) alive[j] = false;
        }
      }
    }
    vector< int > B;
    for(int i = 0; i < N; i++) {
      if(alive[i]) B.emplace_back(A[i]);
    }
    A = B;
    N = A.size();
  }

  {
    for(int i = 17; i >= 0; i--) {
      int x = (S >> i) & 1;
      int y = (T >> i) & 1;
      if(x == 0 && y == 1) { // すべて0でもすべて1でもダメ
        vector< int > arr(N);
        for(int j = 0; j < N; j++) {
          arr[j] = (A[j] >> i) & 1;
        }
        stock.emplace_back(arr);
        tap.emplace_back(1);
      } else if(x == 0) { // すべて1だとダメ
        vector< int > arr(N);
        for(int j = 0; j < N; j++) {
          if((A[j] >> i) & 1) arr[j] = 0; // すべて1だとまずい
          else arr[j] = 1;
        }
        stock.emplace_back(arr);
        tap.emplace_back(0);
      } else if(y == 1) { // すべて0だとダメ
        vector< int > arr(N);
        for(int j = 0; j < N; j++) {
          if((A[j] >> i) & 1) arr[j] = 1;
          else arr[j] = 0;
        }
        stock.emplace_back(arr);
        tap.emplace_back(0);
      }
    }
  }
  int64 ret = 0;
  for(int i = 0; i < (1 << stock.size()); i++) {
    vector< int64 > build(stock.size());
    for(int j = 0; j < stock.size(); j++) {
      if((i >> j) & 1) {
        build[j] = (1LL << N) - 1;
      } else {
        for(int k = 0; k < N; k++) {
          if(stock[j][k] == 0) build[j] |= 1LL << k;
        }
      }
    }
    int64 choose = 0;
    auto rec = MFP([&](auto rec, int bit, int64 val) -> void {
      if(val == 0) return;
      if(bit == stock.size()) {
        choose += C[__builtin_popcountll(val)][K];
        return;
      }
      if((i >> bit) & 1) {
        rec(bit + 1, val);
        return;
      }
      if(tap[bit] == 0) {
        rec(bit + 1, val & build[bit]);
      } else {
        rec(bit + 1, val & build[bit]);
        rec(bit + 1, val & (((1LL << N) - 1) ^ build[bit]));
      }
    });
    rec(0, (1LL << N) - 1);
    if(__builtin_parity(i)) ret += choose;
    else ret -= choose;
  }
  cout << -ret << "\n";
}




Measured memory_bytes: 3636