#include <bits/stdc++.h>
using namespace std;
#define rep(i, n)  for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){ll res=1;a%=mod;while(b){if(b&1)res=res*a%mod;a=a*a%mod;b>>=1;}return res;}
ll modcom(ll n,ll k){
    ll res=1;
    chmin(k,n-k);
    rep(i,k){
        res*=(n-i);res/=i+1;
    }
    return res;
}
int main(){
    ll n,k,s,t;cin>>n>>k>>s>>t;
    vi v(n);
    rep(i,n)cin>>v[i];
    vi a(18);
    vi d;
    rep(i,18){
        ll b=s>>i&1,c=t>>i&1;
        if(b==1){
            if(c==0)dame(0);
            rep(j,v.size()){
                if((v[j]>>i&1)==0){
                    v.erase(v.begin()+j);j--;
                }
            }
        }
        else{
            if(c==1)d.pb(i);
            else{
                rep(j,v.size()){
                    if(v[j]>>i&1){
                        v.erase(v.begin()+j);j--;
                    }
                }
            }
        }
    }
    ll f=d.size(),ans=0;
    n=v.size();
    vi e(1<<f);
    vi co(n+1);
    rep(i,n)rep(j,k){
        if(j>i)break;
        co[i+1]+=modcom(i+1,j+1);
    }
    // outv(d);
    // outv(co);
    // outv(v);
    rep(bit,1<<f){
        ll cnt=0,res=0;
        rep(i,f)if(bit>>i&1)cnt++;
        vi update;
        rep(i,n){
            ll id=0;
            rep(j,f)if(bit>>j&1){
                if(v[i]>>d[j]&1)id+=1<<j;
            }
            e[id]++;
            update.pb(id);
            // out(id);
        }
        for(ll x:update)if(e[x]){
            // outp(P(x,e[x]));
            res+=co[e[x]];e[x]=0;
        }
        // if(res)out(res);
        if(cnt&1)ans-=res;
        else ans+=res;
    }
    out(ans);
}

Measured memory_bytes: 5372