/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int n, k, s, t; cin >> n >> k >> s >> t;
    vector<int> a(n);
    rep(i, n) {
        cin >> a[i];
    }
    vector<bool> ok(n, 1);
    vector<int> v;
    for(int bit = 0; bit < 18; ++ bit) {
        int mask = (1<<bit);
        if(!(s & mask) && !(t & mask)) {
            rep(i, n) {
                if(a[i] & mask) ok[i] = 0;
            }
        } else if(!(s & mask) && (t & mask)) {
            v.push_back(bit);
        } else if((s & mask) && !(t & mask)) {
            cout << 0 << endl;
            return;
        } else {
            rep(i, n) {
                if(!(a[i] & mask)) ok[i] = 0;
            }
        }
    }
    vector<vector<int>> c(n + 1, vector<int>(n + 1));
    for(int i = 0; i <= n; ++ i) {
        c[i][0] = 1;
        for(int j = 1; j <= i; ++ j) {
            c[i][j] = c[i - 1][j] + c[i - 1][j - 1];
        }
    }
    vector<int> ways(n + 1, 0);
    rep(i, n + 1) {
        for(int j = 1; j <= min(k, i); ++ j) {
            ways[i] += c[i][j];
        }
    }
    int ans = 0;
    int sz = (int)v.size();
    for(int bit = 0; bit < (1<<sz); ++ bit) {
        int sign = (__builtin_popcount(bit) % 2 == 0 ? 1 : -1);
        map<int, int> mp;
        rep(i, n) {
            if(ok[i]) {
                int now = 0;
                rep(j, sz) {
                    if((1<< j) & bit) {
                        int mask = (1<<v[j]);
                        if(mask & a[i]) {
                            now ^= mask;
                        }
                    }
                }
                mp[now] ++;
            }
        }
        for(auto p: mp) {
            ans += sign * ways[p.sc];
        }
    }
    cout << ans << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	solve();
    return 0;
}

Measured memory_bytes: 3628