#include <bits/stdc++.h>
using namespace std;
#define LOCAL
#pragma region Macros
typedef long long ll;
#define ALL(x) (x).begin(),(x).end()
const long long MOD=1e9+7;
// const long long MOD=998244353;
const int INF=1e9;
const long long IINF=1e18;
const int dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
const char dir[4]={'D','R','U','L'};

template<typename T>
istream &operator>>(istream &is,vector<T> &v){
    for (T &x:v) is >> x;
    return is;
}
template<typename T>
ostream &operator<<(ostream &os,const vector<T> &v){
    for (int i=0;i<v.size();++i){
        os << v[i] << (i+1==v.size()?"": " ");
    }
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const pair<T,U> &p){
    cout << '(' << p.first << ',' << p.second << ')';
    return os;
}
template<typename T,typename U>
ostream &operator<<(ostream &os,const map<T,U> &m){
    os << '{';
    for (auto itr=m.begin();itr!=m.end();++itr){
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr!=m.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}
template<typename T>
ostream &operator<<(ostream &os,const set<T> &s){
    os << '{';
    for (auto itr=s.begin();itr!=s.end();++itr){
        os << *itr;
        if (++itr!=s.end()) os << ',';
        --itr;
    }
    os << '}';
    return os;
}

void debug_out(){cerr << '\n';}
template<class Head,class... Tail>
void debug_out(Head&& head,Tail&&... tail){
    cerr << head;
    if (sizeof...(Tail)>0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...) cerr << " ";\
cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n';\
cerr << " ";\
debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template<typename T> T gcd(T x,T y){return y!=0?gcd(y,x%y):x;}
template<typename T> T lcm(T x,T y){return x/gcd(x,y)*y;}

template<class T1,class T2> inline bool chmin(T1 &a,T2 b){
    if (a>b){a=b; return true;} return false;
}
template<class T1,class T2> inline bool chmax(T1 &a,T2 b){
    if (a<b){a=b; return true;} return false;
}
#pragma endregion

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K,S,T; cin >> N >> K >> S >> T;
    vector<int> A;
    for (;N--;){
        int a; cin >> a;
        bool ok=true;
        for (int j=0;j<18;++j){
            if ((S&1<<j)&&!(a&1<<j)) ok=false;
            if (!(T&1<<j)&&(a&1<<j)) ok=false;
        }
        if (ok) A.emplace_back(a);
    }
    vector<int> diff;
    for (int i=0;i<18;++i){
        if ((S&1<<i)&&!(T&1<<i)){
            cout << 0 << '\n';
            return 0;
        }
        if (!(S&1<<i)&&(T&1<<i)){
            diff.emplace_back(i);
        }
    }
    N=A.size();
    vector<vector<ll>> choose(N+1,vector<ll>(N+1,0));
    for (int i=1;i<=N;++i){
        choose[i][0]=1;
        for (int j=0;j<min(K,i);++j){
            choose[i][j+1]=choose[i][j]*(i-j)/(j+1);
        }
        for (int j=0;j<N;++j) choose[i][j+1]+=choose[i][j];
    }
    int M=diff.size();
    ll ans=0;
    for (int mask=0;mask<(1<<M);++mask){
        map<int,int> mp;
        for (int i=0;i<N;++i){
            int cnt=0;
            for (int j=0;j<M;++j){
                if (mask&1<<j){
                    cnt|=((A[i]&1<<diff[j])>>diff[j])<<j;
                }
            }
            ++mp[cnt];
        }
        int flag=__builtin_popcount(mask);
        for (auto p:mp){
            if (flag&1) ans-=choose[p.second][min(N,K)]-1;
            else ans+=choose[p.second][min(N,K)]-1;
        }
    }
    cout << ans << '\n';
}

Measured memory_bytes: 3684