#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000009;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#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++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acos(-1.0);


struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n%mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint &a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint &a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint &a, modint b) { a.n = ((ll)a.n*b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, int n) {
	if (n == 0)return modint(1);
	modint res = (a*a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p%a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}
modint combP(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[a - b];
}

ll pas[51][51];
ll score[51];

void init(int k) {
	rep(i, 51)rep(j, 51) {
		if (i == 0 || j == 0)pas[i][j] = 1;
		else pas[i][j] = pas[i - 1][j] + pas[i][j - 1];
	}
	rep(i, 51) {
		rep1(j, i) {
			if (j > k)continue;
			score[i] += pas[i - j][j];
		}
	}
}



vector<vector<int>> memo[1 << 18];
void solve() {
	int n, k, s, t; cin >> n >> k >> s >> t;
	init(k);

	vector<int> a(n);
	rep(i, n) {
		cin >> a[i];
	}
	vector<bool> ban(n,false);
	vector<int> loc;
	rep(i, 18) {
		bool bs = s & (1 << i);
		bool bt = t & (1 << i);
		if (bs && !bt) {
			cout << 0 << "\n"; return;
		}
		else if (bs) {
			rep(j, n) {
				if (a[j] & (1 << i)) {
					//
				}
				else {
					ban[j] = true;
				}
			}
		}
		else if (!bt) {
			rep(j, n) {
				if (a[j] & (1 << i)) {
					ban[j] = true;
				}
			}
		}
		else {
			loc.push_back(i);
		}
	}
	vector<int> nw;
	rep(j, n)if (!ban[j]) {
		int z = 0;
		rep(i, loc.size()) {
			if (a[j] & (1 << loc[i]))z += (1 << i);
		}
		nw.push_back(z);
	}
	swap(a, nw);
	n = a.size();

	int sz = loc.size();

	ll ans = score[n];
	memo[0].push_back({});
	rep(j, n)memo[0][0].push_back(j);

	//cout << "Hello\n";
	for (int i = 1; i < (1 << sz); i++) {
		int p = i;
		int chk = 0;
		rep(j, sz)if (i&(1 << j)) {
			p ^= (1 << j);
			chk = j;
			break;
		}
		ll csum = 0;
		for (vector<int> pre : memo[p]) {
			vector<int> fr, sc;
			for (int id : pre) {
				if (a[id] & (1 << chk)) {
					sc.push_back(id);
				}
				else {
					fr.push_back(id);
				}
			}
			if (fr.size()) {
				memo[i].push_back(fr);
				csum += score[fr.size()];
			}
			if (sc.size()) {
				memo[i].push_back(sc);
				csum += score[sc.size()];
			}
		}
		int tmp = 0;
		rep(j, sz)if (i&(1 << j))tmp ^= 1;
		if (tmp)ans -= csum;
		else ans += csum;
	}
	cout << ans << "\n";
}


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


Measured memory_bytes: 759152