#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = 1; i <= (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define rrng(a) a.rbegin(),a.rend()
#define maxs(x,y) (x = max(x,y))
#define mins(x,y) (x = min(x,y))
#define limit(x,l,r) max(l,min(x,r))
#define lims(x,l,r) (x = max(l,min(x,r)))
#define isin(x,l,r) ((l) <= (x) && (x) < (r))
#define pb push_back
#define eb emplace_back
#define sz(x) (int)(x).size()
#define pcnt __builtin_popcountll
#define uni(x) x.erase(unique(rng(x)),x.end())
#define snuke srand((unsigned)clock()+(unsigned)time(NULL));
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define bn(x) ((1<<x)-1)
#define dup(x,y) (((x)+(y)-1)/(y))
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef unsigned uint;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef tuple<int,int,int> T;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
typedef vector<T> vt;
inline int in() { int x; scanf("%d",&x); return x;}
template<typename T>inline istream& operator>>(istream&i,v(T)&v)
{rep(j,sz(v))i>>v[j];return i;}
template<typename T>string join(const v(T)&v)
{stringstream s;rep(i,sz(v))s<<' '<<v[i];return s.str().substr(1);}
template<typename T>inline ostream& operator<<(ostream&o,const v(T)&v)
{if(sz(v))o<<join(v);return o;}
template<typename T1,typename T2>inline istream& operator>>(istream&i,pair<T1,T2>&v)
{return i>>v.fi>>v.se;}
template<typename T1,typename T2>inline ostream& operator<<(ostream&o,const pair<T1,T2>&v)
{return o<<v.fi<<","<<v.se;}
template<typename T>inline ll suma(const v(T)& a) { ll res(0); for (auto&& x : a) res += x; return res;}
const double eps = 1e-10;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
#define dame { puts("-1"); return 0;}
#define yn {puts("YES");}else{puts("NO");}
const int MX = 200005;

int n;
vl a;

P dfs(int l, int r, int k) {
  if (r-l <= 1) return P(0,0);
  if (k < 0) return P(0,0);
  int pre = a[l]>>k&1;
  int p = -1;
  srep(i,l,r) {
    int now = a[i]>>k&1;
    if (now != pre) {
      if (p != -1) return P(-1,-1);
      p = i;
    }
    pre = now;
  }
  if (p == -1) {
    return dfs(l,r,k-1);
  }
  P pl = dfs(l,p,k-1);
  P pr = dfs(p,r,k-1);
  if (pl.fi == -1) return P(-1,-1);
  if (pr.fi == -1) return P(-1,-1);
  {
    ll s = pl.se&pr.se;
    if ((pl.fi&s) != (pr.fi&s)) return P(-1,-1);
  }
  P res = pl;
  res.fi |= pr.fi;
  res.se |= pr.se;
  res.fi |= ll(!pre)<<k;
  res.se |= 1ll<<k;
  return res;
}

ll dp[65][2][2];

int main() {
  ll L,R;
  scanf("%d%lld%lld",&n,&L,&R);
  a = vl(n);
  cin>>a;
  P res = dfs(0,n,62);
  if (res.fi == -1) {
    cout<<0<<endl;
    return 0;
  }
  dp[62][1][1] = 1;
  drep(i,62) {
    int s = res.fi>>i&1;
    int t = res.se>>i&1;
    int l = L>>i&1;
    int r = R>>i&1;
    rep(j,2)rep(k,2) {
      rep(x,2) {
        if (t && s != x) continue;
        int nj = j, nk = k;
        if (j && !x && l) continue;
        if (k && x && !r) continue;
        if (x && !l) nj = 0;
        if (!x && r) nk = 0;
        dp[i][nj][nk] += dp[i+1][j][k];
      }
    }
  }
  ll ans = 0;
  rep(i,2)rep(j,2) ans += dp[0][i][j];
  cout<<ans<<endl;
  return 0;
}