#include<bits/stdc++.h>
using namespace std;

#define endl '\n'
#define ALL(a)  (a).begin(),(a).end()
#define ALLR(a)  (a).rbegin(),(a).rend()
#define spa << " " <<
#define test cout<<"test"<<endl;
#define fi first
#define se second
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define rep(i,n,m) for(ll i = n; i < (ll)(m); i++)
#define rrep(i,n,m) for(ll i = m - 1; i >= (ll)(n); i--)
using ll = long long;
using ld = long double;
const ll MOD = 1e9+7;
//const ll MOD = 998244353;
const ll INF = 1e18;
using P = pair<ll, ll>;
template<typename T>
void chmin(T &a,T b){if(a>b)a=b;}
template<typename T>
void chmax(T &a,T b){if(a<b)a=b;}
void pmod(ll &a,ll b){a=(a+b)%MOD;}
void pmod(ll &a,ll b,ll c){a=(b+c)%MOD;}
void qmod(ll &a,ll b){a=(a*b)%MOD;}
void qmod(ll &a,ll b,ll c){a=(b*c)%MOD;}
ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});}
void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;}
void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;}
void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;}
template<typename T1,typename T2>
void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;}  
template<typename T>
void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++)
{cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}};
void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++)
{for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}};
template<typename T>
void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];
for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;};
template<typename T>
vector<vector<T>>vec(ll x, ll y, T w){
  vector<vector<T>>v(x,vector<T>(y,w));return v;}
ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;}
vector<ll>dx={1,0,-1,0,1,1,-1,-1};
vector<ll>dy={0,1,0,-1,1,-1,1,-1};
template<typename T>
vector<T> make_v(size_t a,T b){return vector<T>(a,b);}
template<typename... Ts>
auto make_v(size_t a,Ts... ts){
  return vector<decltype(make_v(ts...))>(a,make_v(ts...));
}

int main(){
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  //cout<<fixed<<setprecision(10);
  ll res=0,buf=0;
  bool judge = true;
  ll n,l,r;cin>>n>>l>>r;
  vector<ll>a(n);
  rep(i,0,n)cin>>a[i];
  vector<ll>t(61,-1);
  rep(i,0,n-1){
    bitset<62>x=a[i];
    bitset<62>y=a[i+1];
    rrep(i,0,62){
      if(x[i]!=y[i]){
        if(x[i]){
          if(t[i]==-1)t[i]=1;
          else if(t[i]==0)judge=false;
        }
        else{
          if(t[i]==-1)t[i]=0;
          else if(t[i]==1)judge=false;
        }
        break;
      }
    }
  }
  if(judge){
    reverse(ALL(t));
    //debug(t,61);
    auto dp=make_v(62,2,2,0LL);
    dp[0][0][0]=1;
    rep(i,0,61){
      ll lp=(1LL<<60-i)&l,rp=(1LL<<60-i)&r;
      if(lp!=0)lp=1;if(rp!=0)rp=1;
      //cout<<lp spa rp<<endl;
      if(t[i]==0||t[i]==-1){
        if(!lp)dp[i+1][0][1]+=dp[i][0][1];
        if(!rp)dp[i+1][1][0]+=dp[i][1][0];
        else dp[i+1][1][1]+=dp[i][1][0];
        if(!lp&&!rp)dp[i+1][0][0]+=dp[i][0][0];
        else if(!lp)dp[i+1][0][1]+=dp[i][0][0];
        dp[i+1][1][1]+=dp[i][1][1];
      }
      if(t[i]==1||t[i]==-1){
        if(lp)dp[i+1][0][1]+=dp[i][0][1];
        else dp[i+1][1][1]+=dp[i][0][1];
        if(rp)dp[i+1][1][0]+=dp[i][1][0];
        if(lp&&rp)dp[i+1][0][0]+=dp[i][0][0];
        else if(rp)dp[i+1][1][0]+=dp[i][0][0];
        dp[i+1][1][1]+=dp[i][1][1];
      }
      //cout<<i spa lp spa rp<<endl;
      //if(i>=40)debug(dp[i+1],2,2);
    }
    rep(i,0,2)rep(j,0,2)res+=dp[61][i][j];
    cout<<res<<endl;
  }
  else cout<<0<<endl;
  return 0;
}