// clang-format off
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define stoi stoll
using pii = pair<int,int>;
using vi = vector<int>;
using vvi = vector<vi>;
#define all(c) begin(c), end(c)
#define rall(c) rbegin(c), rend(c)
#define fore(x, c) for(auto &&x : c)
#define rep(i, a, n) for(int i = a, i##len = (int)(n); i < i##len; ++i)
#define rrep(i, a, n) for(int i = (int)(n - 1); i >= a; --i)
#define sz(c) ((int)c.size())
#define contains(c, x) (c.find(x) != end(c))
#define inseg(l, x, r) ((l) <= (x) && (x) < (r))
#define dump(...)
#define pb push_back
#define eb emplace_back
#define _ 0
const signed INF_ = 1001001001; const long long INF = 1001001001001001001LL;
const int DX[9] = {0,1,0,-1,1,1,-1,-1,0}, DY[9] = {-1,0,1,0,-1,1,1,-1,0};
template<class T> ostream& operator<<(ostream &os, const vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) os<<*i<<(i==end(v)-1?"":" ");return os;}
template<class T> istream& operator>>(istream &is, vector<T> &v) {
  for (auto i = begin(v); i != end(v); i++) is>>*i;return is;}
template<class T,class U> istream& operator>>(istream &is, pair<T,U> &p) {
  is>>p.first>>p.second;return is;}
template<class T, class U> bool chmax(T &a, const U &b){return a<b?a=b,1:0;}
template<class T, class U> bool chmin(T &a, const U &b){return a>b?a=b,1:0;}
template <class T> void psum(T& c) {partial_sum(begin(c), end(c), begin(c));}
template<class T> using heap = priority_queue<T, deque<T>, greater<T>>;
struct before_main_function {
  before_main_function() {
      cin.tie(nullptr); ios::sync_with_stdio(0);
      cout << setprecision(15) << fixed;
  }
} before_main_function;
// clang-format on
//------------------8<------------------------------------8<--------------------

const int N_MAX = 100;
int combination[N_MAX][N_MAX];
struct combination_init {
  combination_init() {
    for (int i = 0; i < N_MAX; i++) combination[i][0] = 1;
    for (int i = 1; i < N_MAX; i++) {
      for (int j = 1; j < N_MAX; j++) {
        combination[i][j] = combination[i - 1][j] + combination[i - 1][j - 1];
      }
    }
  }
} combination_init;
signed main() {
  int N, K, S, T;
  cin >> N >> K >> S >> T;
  vi A(N);
  cin >> A;
  vector<bool> valid(N, true);
  int overall = 0;
  rep(i, 0, 18) {
    if ((S >> i) & 1) overall |= 1 << i;
    if (!((T >> i) & 1)) overall |= 1 << i;

    rep(j, 0, N) {
      if ((S >> i) & 1) {
        if (!((A[j] >> i) & 1)) valid[j] = false;
      }
      if (!((T >> i) & 1)) {
        if ((A[j] >> i) & 1) valid[j] = false;
      }
    }
  }
  vi B;
  rep(i, 0, N) if (valid[i]) B.pb(A[i]);
  A.swap(B);
  N = sz(A);

  static int table[51][51];
  rep(n, 0, 51) {
    table[n][0] = 0;
    rep(k, 1, 51) { table[n][k] = table[n][k - 1] + combination[n][k]; }
  }

  static int dp[1 << 18];
  rep(mask, 0, 1 << 18) {
    map<int, int> cnt;
    rep(i, 0, N) cnt[mask & A[i]]++;
    for (auto p : cnt) {
      dp[mask] += table[p.second][K];
    }
    if (mask & overall) dp[mask] = 0;
  }

  int ans = 0;
  rep(s, 0, 1 << 18) {
    if (!dp[s]) continue;
    int p = __builtin_popcount(s);
    if (p % 2) {
      ans -= dp[s];
    } else {
      ans += dp[s];
    }
  }
  cout << ans << endl;
  return (0 ^ _ ^ 0);
}



Measured memory_bytes: 5828