#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)

int n, k, x, y, ans, a[8];
void dfs(int num, int val, int pre) {
    if(num == n){
        ans += x<= val && val <= y;
        return;
    }
    rep(i,k){
        if(i!=pre)dfs(num+1,val^a[i],i);
    }
}
int main(){
    cin>>n>>k>>x>>y;
    rep(i,k)cin>>a[i];
    dfs(0,0,-1);
    cout<<ans<<endl;
}