#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	long long l, r; cin >> l >> r;
	vector<long long>a(n);
	rep(i, n)cin >> a[i];
	auto f = [&](long long mx)->long long {
		if (mx < 0)return 0;
		vector<int>need(61, -1);
		rep(i, n - 1) {
			rrep(j, 61) {
				int x = 1 & (a[i + 0] >> j);
				int y = 1 & (a[i + 1] >> j);
				if (x == y)continue;
				if (-1 == need[60 - j]) need[60 - j] = x > y;
				else if (need[60 - j] != (x > y)) return 0;
				break;
			}
		}

		vector dp(62, vector<long long>(2));//未満が1
		dp[0][0] = 1;
		rep(i, 61) {
			vector<int> num;
			if (-1 == need[i]) num = { 1,0 };
			else num = { need[i] };
			rep(j, 2) {
				int k = 1 & (mx >> (60 - i));
				rep(l, num.size()) {
					int nx = num[l];
					if (!j && k < nx) continue;
					int nj = !(!j && (k == nx));
					dp[i + 1][nj] += dp[i][j];
				}
			}
		}
		return dp[61][1] + dp[61][0];
	};
	long long ans = f(r) - f(l - 1);
	cout << ans << endl;
	return 0;
}