#pragma GCC optimize("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")

#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
#define SZ(x) ((int)((x).size()))

template <typename T1, typename T2>
string print_iterable(T1 begin_iter, T2 end_iter, int counter) {
    bool done_something = false;
    stringstream res;
    res << "[";
    for (; begin_iter != end_iter and counter; ++begin_iter) {
        done_something = true;
        counter--;
        res << *begin_iter << ", ";
    }
    string str = res.str();
    if (done_something) {
        str.pop_back();
        str.pop_back();
    }
    str += "]";
    return str;
}

vector<int> SortIndex(int size, std::function<bool(int, int)> compare) {
    vector<int> ord(size);
    for (int i = 0; i < size; i++) ord[i] = i;
    sort(ord.begin(), ord.end(), compare);
    return ord;
}

template <typename T>
bool MinPlace(T& a, const T& b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template <typename T>
bool MaxPlace(T& a, const T& b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template <typename S, typename T>
ostream& operator <<(ostream& out, const pair<S, T>& p) {
    out << "{" << p.first << ", " << p.second << "}";
    return out;
}

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

template<class TH>
void _dbg(const char* name, TH val){
    clog << name << ": " << val << endl;
}
template<class TH, class... TA>
void _dbg(const char* names, TH curr_val, TA... vals) {
    while(*names != ',') clog << *names++;
    clog << ": " << curr_val << ", ";
    _dbg(names+1, vals...);
}

#if DEBUG && !ONLINE_JUDGE
    ifstream input_from_file("input.txt");
    #define cin input_from_file

    #define dbg(...) _dbg(#__VA_ARGS__, __VA_ARGS__)
    #define dbg_arr(x, len) clog << #x << ": " << print_iterable(x, x+len, -1) << endl;
#else
    #define dbg(...)
    #define dbg_arr(x, len)
#endif

///////////////////////////////////////////////////////////////////////////
//////////////////// DO NOT TOUCH BEFORE THIS LINE ////////////////////////
///////////////////////////////////////////////////////////////////////////


const int MAXN = 52;
LL binom[MAXN][MAXN];
LL pref_bin[MAXN];
int Z;
vector<ULL> splittings;
vector<ULL> antisplittings;

LL res = 0;

void dfs(ULL curr, int pos, bool parity) {
    if (curr == 0) return;
    if (pos == Z) {
        if (parity) res -= pref_bin[__builtin_popcountll(curr)];
        else res += pref_bin[__builtin_popcountll(curr)];
        return;
    }
    dfs(curr, pos+1, parity);
    dfs(curr&splittings[pos], pos+1, !parity);
    dfs(curr&antisplittings[pos], pos+1, !parity);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0); // Remove in problems with online queries!

    for (int n = 0; n < MAXN; n++) {
        binom[n][0] = 1;
        for (int m = 1; m <= n; m++) binom[n][m] = binom[n-1][m-1] + binom[n-1][m];
    }
    

    int N, K, S, T;
    cin >> N >> K >> S >> T;
    vector<int> A;
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        if ((a&S) == S and (a|T) == T) A.push_back(a);
    }
    N = A.size();
    K = min(K, N);
    for (int i = 0; i < 18; i++) {
        int pot = 1<<i;
        if ((S&pot) == (T&pot)) continue;
        ULL bb = 0;
        for (int j = 0; j < N; j++) if (A[j]&pot) bb ^= 1ll<<j;
        splittings.push_back(bb);
        antisplittings.push_back(~bb);
    }
    
    for (int n = 0; n <= N; n++) {
        for (int i = 1; i <= K; i++) pref_bin[n] += binom[n][i];
    }

    Z = splittings.size();
    dfs((1ll<<N)-1, 0, 0);
    cout << res << "\n";
}


Measured memory_bytes: 3692