#include <bits/stdc++.h>
using namespace std;

using ll=long long;
#define rng(i,l,r) for(int i=int(l);i<int(r);i++)
#define rep(i,r) rng(i,0,r)
#define rrng(i,l,r) for(int i=int(r)-1;i>=int(l);i--)
#define rrep(i,r) rrng(i,0,r)
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define mt make_tuple
#define one(x) memset(x,-1,sizeof(x))
#define zero(x) memset(x,0,sizeof(x))
#define F first
#define S second
#define bg begin()
#define ed end()
#define all(x) x.bg,x.ed
#define si(x) int(x.size())
#define inf INT_MAX/2-100
#define infl LLONG_MAX/3
#ifdef LOCAL
#define dmp(x) cerr<<__LINE__<<' '<<#x<<' '<<x<<endl
#else
#define dmp(x) void(0)
#endif

template<class t,class u>void chmax(t&a,u b){if(a<b)a=b;}
template<class t,class u>void chmin(t&a,u b){if(b<a)a=b;}

template<class t>using vc=vector<t>;
template<class t>using vvc=vector<vector<t>>;

using pi=pair<int,int>;
using pl=pair<ll,ll>;
using vi=vc<int>;
using vl=vc<ll>;


ll readl(void){
	ll x;
	cin>>x;
	return x;
}
int readi(void){
	int x;
	cin>>x;
	return x;
}

string readstr(){
	string s;
	cin>>s;
	return s;
}
vi readvi(int n,int off=0){
	vi v(n);
	rep(i,n)v[i]=readi(),v[i]+=off;
	return v;
}

vl readvl(int n,int off=0){
	vl v(n);
	rep(i,n)v[i]=readl(),v[i]+=off;
	return v;
}

template<class t>
void print(t x,int suc=1){
	cout<<x;
	if(suc==1)cout<<"\n";
	if(suc==2)cout<<" ";
}

template<class t>
void print(const vc<t>&v,int suc=1){
	rep(i,si(v))print(v[i],i==int(si(v))-1?1:suc);
}

template<class t>
bool inc(t a,t b,t c){
	return !(c<b||b<a);
}

template<class t>
void compress(vc<t>&v){
	sort(all(v));
	v.erase(unique(all(v)),v.ed);
}

template<class t>
int lwb(const vc<t>&v,const t&a){
	return lower_bound(all(v),a)-v.bg;
}

template<class t>
struct Compress{
	vc<t>v;
	Compress()=default;
	Compress(const vc<t>&x){
		add(x);
	}
	Compress(const initializer_list<vc<t> >&x){
		for(auto &p:x)add(p);
	}
	void add(const t&x){
		v.eb(x);
	}
	void add(const vc<t>&x){
		copy(all(x),back_inserter(v));
	}
	void build(){
		compress(v);
	}
	int get(const t&x)const{
		return lwb(v,x);
	}
	vc<t>get(const vc<t>&x)const{
		vc<t>res(x);
		for(auto &p:res)p=get(p);
		return res;
	}
	const t &operator[](int x)const{
		return v[x];
	}
};
void Yes(bool ex=true){
	cout<<"Yes\n";
	if(ex)exit(0);
}
void YES(bool ex=true){
	cout<<"YES\n";
	if(ex)exit(0);
}
void No(bool ex=true){
	cout<<"No\n";
	if(ex)exit(0);
}
void NO(bool ex=true){
	cout<<"NO\n";
	if(ex)exit(0);
}
void orYes(bool x,bool ex=true){
	if(x)Yes(ex);
	else No(ex);
}
void orYES(bool x,bool ex=true){
	if(x)YES(ex);
	else NO(ex);
}
void Possible(bool ex=true){
	cout<<"Possible\n";
	if(ex)exit(0);
}
void POSSIBLE(bool ex=true){
	cout<<"POSSIBLE\n";
	if(ex)exit(0);
}
void Impossible(bool ex=true){
	cout<<"Impossible\n";
	if(ex)exit(0);
}
void IMPOSSIBLE(bool ex=true){
	cout<<"IMPOSSIBLE\n";
	if(ex)exit(0);
}
void orPossible(bool x,bool ex=true){
	if(x)Possible(ex);
	else Impossible(ex);
}
void orPOSSIBLE(bool x,bool ex=true){
	if(x)POSSIBLE(ex);
	else IMPOSSIBLE(ex);
}

ll p[55][55],com[55][55],ans,np;
int n,k,s,t,a[55],b[55][20],c[55];
int z[20],q,w[20];
int main(void){
	cin.tie(0);
	ios::sync_with_stdio(0);
	cin>>n>>k>>s>>t;
	rep(i,n)cin>>a[i];
	rep(i,n+1){
		rep(j,i+1){
			if(j==0)com[i][j]=1;
			if(i>0){
				com[i][j]=com[i-1][j];
				if(j>0){
					com[i][j]+=com[i-1][j-1];
				}
			}
			if(j>0)p[i][j]=com[i][j];
			if(j>0)p[i][j]+=p[i][j-1];
			//cout<<i<<' '<<j<<' '<<p[i][j]<<endl;
		}
	}
	rep(i,18){
		int x=s>>i&1;
		int y=t>>i&1;
		if(x==0&&y==0)z[i]=0;
		if(x==0&&y==1){
			z[i]=-1;
			q++;
		}
		if(x==1&&y==0){
			cout<<0<<endl;
			return 0;
		}
		if(x==1&&y==1)z[i]=1;
	}
	int np=0;
	rep(i,n){
		bool ok=true;
		rep(j,18){
			if(z[j]!=-1&&(a[i]>>j&1)!=z[j]){
				ok=false;
			}
		}
		if(ok){
			a[np]=a[i];
			np++;
		}
	}
	n=np;
	rep(i,n){
		int u=0;
		rep(j,18){
			if(z[j]==-1){
				b[i][u]=(a[i]>>j&1);
				u++;
			}
		}
	}
	//cout<<q<<endl;
	rep(i,1<<q){
		ll ret=0;
		int u=0;
		rep(j,n)c[j]=0;
		rep(j,q){
			if(i>>j&1){
				u++;
				rep(l,n){
					c[l]+=b[l][j]*(1<<j);
				}
			}
		}
		sort(c,c+n);
		int e=0;
		rep(j,n){
			e++;
			if(j==n-1||c[j+1]!=c[j]){
				if(u%2==1)ans-=p[e][min(e,k)];
				else ans+=p[e][min(e,k)];
				e=0;
			}
		}
	}
	cout<<ans<<endl;
}


Measured memory_bytes: 3620