#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int (X) = 0;(X) < (Y);++(X))
#define reps(X,S,Y) for (int (X) = S;(X) < (Y);++(X))
#define rrep(X,Y) for (int (X) = (Y)-1;(X) >=0;--(X))
#define rreps(X,S,Y) for (int (X) = (Y)-1;(X) >= (S);--(X))
#define repe(X,Y) for ((X) = 0;(X) < (Y);++(X))
#define peat(X,Y) for (;(X) < (Y);++(X))
#define all(X) (X).begin(),(X).end()
#define rall(X) (X).rbegin(),(X).rend()
#define eb emplace_back
#define UNIQUE(X) (X).erase(unique(all(X)),(X).end())
#define Endl endl
#define NL <<"\n"

using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "../benri.h"
#else
#define out(args...)
#endif
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
const ll MOD=1e9+7; //998244353

ll fun(vector<int> zero,vector<int> one,ll n){
	ll re=0;
	rrep(d,64){
		if(n>>d&1){
			ll t=1;
			rrep(e,d)if(!zero[e]&&!one[e]) t*=2;
			if(!one[d]) re+=t;
			if(zero[d]) break;
		}else{
			if(one[d]) break;
		}
	}
	out(zero,one,n,1);
	return re;
}

int main(){
  ios_base::sync_with_stdio(false); cin.tie(0);
  cout<<fixed<<setprecision(0);
	int n;
	ll l,r;
	cin>>n>>l>>r; ++r;
	vector<ll> a(n);
	rep(i,n) cin>>a[i];
	vector<int> zero(64);
	vector<int> one(64);
	reps(i,1,n){
		ll s=a[i-1],t=a[i];
		t^=s;
		rrep(i,64)if(t>>i&1){
			(s>>i&1?one:zero)[i]=1;
			break;
		}
	}
	rep(i,64)if(zero[i]&&one[i]){
		cout<<0<<endl;
		return 0;
	}
	cout<<fun(zero,one,r)-fun(zero,one,l)<<endl;
  return 0;
}