#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef tuple<ll,ll,ll> tl;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll inf=1000000000000000000;
double pi=2*acos(0);
#define rep(i,m,n) for(ll i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
ll lmax(ll a,ll b){
    if(a<b)return b;
    else return a;
}
ll lmin(ll a,ll b){
    if(a<b)return a;
    else return b;
}
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll f(vector<ll> v,ll n){
    ll dp[61][2][2];
    memset(dp,0,sizeof dp);
    ll che=0;
    rep(i,0,61){
        ll u=Pow(2,60-i);
        ll y=v[i];
        if(v[i]==-1)y=0;
        che+=u*y;
        
    }
    if(che>n)return 0;
    if(v[0]==0){
        ll u=Pow(2,60);
        ll uu=n/u;
        if(uu%2==1){
            dp[0][0][0]=1;
            
        }
        else dp[0][1][0]=1;
    }
    else if(v[0]==1){
        dp[0][1][1]=1;
    }
    else{
        ll u=Pow(2,60);
        ll uu=n/u;
        if(uu%2==1){
            dp[0][0][0]=1;
            dp[0][1][1]=1;
            
        }
        else{
            dp[0][1][0]=1;
        }
    }
    rep(i,1,61){
        if(v[i]==0){
            ll u=Pow(2,60-i);
            ll uu=n/u;
            if(uu%2==1){
                dp[i][0][0]=dp[i-1][0][0]+dp[i-1][0][1]
                +dp[i-1][1][0]+dp[i-1][1][1];
                
                
            }
            else{
                dp[i][0][0]=dp[i-1][0][0]+dp[i-1][0][1];
                dp[i][1][0]=dp[i-1][1][0]+dp[i-1][1][1];
            }
        }
        else if(v[i]==1){
            ll u=Pow(2,60-i);
            ll uu=n/u;
            if(uu%2==1){
                dp[i][0][1]=dp[i-1][0][0]+dp[i-1][0][1]
                ;
                dp[i][1][1]=dp[i-1][1][0]+dp[i-1][1][1];
                
            }
            else{
                dp[i][0][1]=dp[i-1][0][0]+dp[i-1][0][1];
                
            }
        }
        else{
            ll u=Pow(2,60-i);
            ll uu=n/u;
            if(uu%2==1){
                dp[i][0][1]=dp[i-1][0][0]+dp[i-1][0][1];
                dp[i][1][1]=dp[i-1][1][0]+dp[i-1][1][1];
                dp[i][0][0]=dp[i-1][0][0]+dp[i-1][0][1]+dp[i-1][1][0]+
                            dp[i-1][1][1];
            }
            else{
                dp[i][0][0]=dp[i-1][0][1]+dp[i-1][0][0];
                dp[i][0][1]=dp[i-1][0][1]+dp[i-1][0][0];
                dp[i][1][0]=dp[i-1][1][0]+dp[i-1][1][1];
                
            }
        }
    }
    return dp[60][0][0]+dp[60][0][1]+dp[60][1][0]+dp[60][1][1];
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    ll n,l,r;cin>>n>>l>>r;
    ll a[n];rep(i,0,n)cin>>a[i];
    vector<ll> v;
    rep(i,0,61)v.push_back(-1);
    rep(i,1,n){
        ll u=a[i]^a[i-1];
        ll now=1;
        ll num;
        rep(j,0,70){
            if(now>u){
                num=j-1;
                break;
            }
            now*=2;
        }
        if(a[i]>a[i-1]){
            if(v[60-num]==1){
                cout<<0<<endl;
                return 0;
            }
            v[60-num]=0;
        }
        else{
            if(v[60-num]==0){
                cout<<0<<endl;
                return 0;
            }
            v[60-num]=1;
        }
    }
    ll s1=f(v,r);
    ll s2;
    if(l>0)s2=f(v,l-1);
    else s2=0;
    cout<<s1-s2<<endl;
}