#include #include #include template std::vector> runlength( It begin, It end) { using T = typename It::value_type; std::vector> res; while (begin != end) { const T& c = *(begin++); if (res.empty() || c != res.back().first) { res.emplace_back(c, 1); } else { ++res.back().second; } } return res; } constexpr int K = 61; using lint = long long; void solve() { int n; lint xl, xr; std::cin >> n >> xl >> xr; std::vector xs(n); for (auto& x : xs) std::cin >> x; std::vector ts(K, 3); std::function dfs = [&](int l, int r, int k) -> void { if (k < 0) return; std::vector bs; for (int i = l; i < r; ++i) { bs.push_back((xs[i] >> k) & 1); } auto ps = runlength(bs.begin(), bs.end()); int t; if (ps.size() == 1) { t = 3; } else if (ps.size() == 2) { t = 1 << bs[0]; } else { t = 0; } ts[k] &= t; if (ps.size() == 1) { dfs(l, r, k - 1); } else if (ps.size() == 2) { int m = l + ps.front().second; dfs(l, m, k - 1); dfs(m, r, k - 1); } }; dfs(0, n, K - 1); auto calc = [&](lint m) -> lint { if (m < 0) return 0; std::vector dp(2, 1); auto ndp = dp; for (int k = 0; k < K; ++k) { std::fill(ndp.begin(), ndp.end(), 0); for (int d = 0; d < 2; ++d) { if (((ts[k] >> d) & 1) == 0) continue; ndp[0] += dp[0]; if (d < ((m >> k) & 1)) ndp[1] += dp[0]; if (d == ((m >> k) & 1)) ndp[1] += dp[1]; } std::swap(dp, ndp); } return dp[1]; }; std::cout << calc(xr) - calc(xl - 1) << "\n"; } int main() { std::cin.tie(nullptr); std::ios::sync_with_stdio(false); solve(); return 0; }