#include using namespace std::literals::string_literals; using i64 = std::int_fast64_t; using std::cout; using std::endl; using std::cin; template std::vector make_v(size_t a){return std::vector(a);} template auto make_v(size_t a,Ts... ts){ return std::vector(ts...))>(a,make_v(ts...)); } int main() { int n; i64 L, R; scanf("%d%lld%lld", &n, &L, &R); std::vector a(n); for(int i = 0; i < n; i++) scanf("%lld", &a[i]); // 0011 | 0011 | 0011 -> 1 pattern // 0011 | 1100 | .... -> inpossiblent i = 0; i < 60; i++) { // 0000000 or 1111111 -> 2 pattern std::vector kiri(n + 1, false); kiri[n] = true; // 数列切るたん, left) std::vector tan(61, 0); // true -> 1 pattern for(int k = 60; k >= 0; k--) { // x: 1100 // y: 0011 // z: 0000 or 1111 int x = 0, y = 0, z = 0, w = 0; for(int i = 0; i < n; i++) { if(kiri[i + 1]) { if(w > 1) { printf("0\n"); return 0; } else if(w == 0) { z++; } w = 0; continue; } int A = a[i] >> k & 1, B = a[i + 1] >> k & 1; if(A == B) continue; kiri[i + 1] = true; if(A) x++; else y++; w++; } if(x and y) { printf("0\n"); return 0; } if(x) tan[k] = 1; else if(y) tan[k] = 0; else tan[k] = -1; } auto calc = [&](i64 t) -> i64 { if(t < 0) return 0LL; auto dp = make_v(62, 2); dp[0][1] = 1; for(int k = 60, i = 0; k >= 0; k--, i++) { if(t >> k & 1) { if(tan[k] == 0) { dp[i + 1][0] += dp[i][0] + dp[i][1]; } else if(tan[k] == 1) { dp[i + 1][0] += dp[i][0]; dp[i + 1][1] += dp[i][1]; } else { dp[i + 1][0] += dp[i][0] * 2LL + dp[i][1]; dp[i + 1][1] += dp[i][1]; } } else { if(tan[k] == 0) { dp[i + 1][0] += dp[i][0]; dp[i + 1][1] += dp[i][1]; } else if(tan[k] == 1) { dp[i + 1][0] += dp[i][0]; } else { dp[i + 1][0] += dp[i][0] * 2LL; dp[i + 1][1] += dp[i][1]; } } } return (dp[61][0] + dp[61][1]); }; printf("%lld\n", calc(R) - calc(L - 1)); return 0; }