#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<n;i++)
using namespace std;
using ll =  long long ;
using P = pair<int,int> ;
using pp = pair<bool,bool>;
const int INF = 1e9;
const int MOD = 1000000007;
int n = 200005;
vector<string> a(n);

ll f(ll x){
    bitset<64> bit(x);
    string s = bit.to_string();
    vector<vector<ll>> dp(65,vector<ll>(2,0));
    vector<int> group(n,0);
    int g_cnt = 1;
    dp[0][0] = 1;

    auto one_zero_ok = [&](int i){
        bool ok = true;
        vector<bool> flg(4,false);
        int g = 0,idx = 0;
        while(g < g_cnt){
            bool one = false,zero = false;
            int c = 0;
            while(idx < n){
                if(group[idx] != g) break;
                if(a[idx][i] =='1' && !one) one = true,zero = false,c++;
                else if(a[idx][i] =='0' && !zero) zero = true,one = false,c++;
                idx ++;
            }
            //cout << c << endl;
            if(c==2 && one) flg[0] = true;
            else if(c==2 && zero) flg[1] = true;
            else if(c==1 && zero) flg[2] = true;
            else if(c==1 && one) flg[3] = true;
            else ok = false;
            ++g;
        }
        if(!ok) return pp(false,false);
        //rep(j,4) cout << flg[j] ? "Y" : "N" ;
        //cout << endl;
        vector<int> pre_group(n,0);
        g_cnt = 0;
        rep(j,n-1){
            pre_group[j] = g_cnt;
            if((a[j][i] != a[j+1][i])||(group[j] != group[j+1])) g_cnt ++;
        }
        pre_group[n-1] = g_cnt;
        swap(pre_group,group);
        g_cnt ++;
        pp res = pp(true,true);
        if(flg[0]) res.second = false;
        if(flg[1]) res.first = false;
        return res;
    };

    for(int i=1;i<65;i++){
        bool one_ok,zero_ok;
        tie(zero_ok,one_ok) = one_zero_ok(i-1);
        if(s[i-1] == '1'){
            if(one_ok){
                dp[i][0] += dp[i-1][0];
                dp[i][1] += dp[i-1][1];
            }if(zero_ok){
                dp[i][1] += dp[i-1][0] + dp[i-1][1];
            }
        }else{
            if(one_ok){
                dp[i][1] += dp[i-1][1];
            }if(zero_ok){
                dp[i][1] += dp[i-1][1];
                dp[i][0] += dp[i-1][0];
            }
        }
    }
    if(g_cnt != n) return 0;
    else return dp[64][0] + dp[64][1];
}

int main(){
    ll l,r;
    cin >> n >> l >> r;
    rep(i,n){
        ll p;
        cin >> p;
        bitset<64> b(p);
        string bi = b.to_string();
        a[i] = bi;
        //cout << a[i] << endl;
    }
    ll ans ;
    if(l==0) ans = f(r);
    else ans = f(r) - f(l-1);
    cout << ans << endl;
    return 0;
}