#include <bits/stdc++.h>
using namespace std;
#define modulo 1000000007
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 100000000

long long DP(vector<int> B,long long M){
	vector<vector<long long>> dp(61,vector<long long>(2,0));
	for(int i=60;i>=0;i--){
		if(i==60){
			if(B[i]==-1){
				if(M&((long long)1<<i)){
					dp[i][0]=1;
					dp[i][1]=1;
				}
				else{
					dp[i][0]=1;
				}
			}
			if(B[i]==0){
				if(M&((long long)1<<i)){
					dp[i][1]=1;
				}
				else{
					dp[i][0]=1;
				}
			}
			if(B[i]==1){
				if(M&((long long)1<<i)){
					dp[i][0]=1;
				}
			}
		}
		else{
			if(B[i]==-1){
				if(M&((long long)1<<i)){
					dp[i][0]=dp[i+1][0];
					dp[i][1]=dp[i+1][0]+2*dp[i+1][1];
				}
				else{
					dp[i][0]=dp[i+1][0];
					dp[i][1]=2*dp[i+1][1];
				}
			}
			if(B[i]==0){
				if(M&((long long)1<<i)){
					dp[i][1] = dp[i+1][0]+dp[i+1][1];
				}
				else{
					dp[i][0]=dp[i+1][0];
					dp[i][1]=dp[i+1][1];
				}
			}
			if(B[i]==1){
				if(M&((long long)1<<i)){
					dp[i][0]=dp[i+1][0];
					dp[i][1]=dp[i+1][1];
				}
				else{
					dp[i][1]=dp[i+1][1];
				}
			}
		}
	}
	
	for(int i=0;i<4;i++){
		//cout<<dp[i][0]<<','<<dp[i][1]<<endl;
		//cout<<B[i]<<endl;
	}
	
	return dp[0][0]+dp[0][1];
}

int main(){
	
	int N;
	cin>>N;
	
	long long L,R;
	cin>>L>>R;
	
	vector<long long> A(N);
	
	for(int i=0;i<N;i++){
		cin>>A[i];
		//cout<<(bitset<12>)A[i]<<endl;
	}
	
	
	if(N==1){
		cout<<R-L+1<<endl;
		return 0;
	}
	
	vector<bool> ok(N,false);
	ok[0]=true;
	
	vector<int> B(61,-1);

	for(int i=60;i>=0;i--){
		bool f1 = true;
		bool f2 = true;
		for(int j=1;j<N;j++){
			if(ok[j])continue;
			bool a = (A[j-1] & ((long long)1<<i));
			bool b = (A[j] & ((long long)1<<i));
			if(a&&!b)f1=false;
			if(b&&!a)f2=false;
			if(a!=b)ok[j]=true;
		}
		if(!f1&&!f2){
			cout<<0<<endl;
			return 0;
		}
		
		if(f1&&!f2)B[i]=0;
		if(f2&&!f1)B[i]=1;
		
		bool f = true;
		for(int j=0;j<N;j++){
			if(!ok[j]){
				f=false;
				break;
			}
		}
		if(f)break;
	}

	
	
	if(L!=0)cout<<DP(B,R)-DP(B,L-1)<<endl;
	else cout<<DP(B,R)<<endl;
	
    return 0;
}