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

void finish(long long ans) {
    cout << ans << endl;
    exit(0);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    int n;
    cin >> n;
    long long l, r;
    cin >> l >> r;
    vector<long long> as(n);
    for (int i = 0; i < n; i++) cin >> as[i];

    vector<int> fix(62);
    vector<pair<int, int>> kukan = {{0, n - 1}};

    auto get_type = [](const vector<int> &nums) -> int {
        // 各区間が全部0...1ならreturn 0
        // 全部1...0ならreturn 1
        // 全部同じならreturn 2
        // そうでないならreturn 3

        if (nums.size() == 1) return 2;

        vector<int> dif;
        for (int i = 1; i < nums.size(); i++) {
            if (nums[i] != nums[i - 1]) {
                dif.push_back(i);
            }
        }
        if (dif.empty()) return 2;
        if (dif.size() > 1) return 3;
        if (nums[0] == 0) return 0;
        return 1;
    };

    auto hoge = [&](int k) -> int {
        // 全部が2ならreturn 2
        // 0と2ならreturn 0
        // 1と2ならreturn 1
        // そうでないならreturn 3

        int types = 0;
        vector<pair<int, int>> nxt;
        for (auto &p : kukan) {
            vector<int> nums;
            for (int i = p.first; i <= p.second; i++) {
                nums.push_back(as[i] >> k & 1);
            }

            int type = get_type(nums);
            if (type == 3) {
                finish(0);
            }

            if (type == 0 || type == 1) {
                int dif = -1;
                for (int i = 1; i < nums.size(); i++) {
                    if (nums[i] != nums[i - 1]) {
                        dif = i;
                        break;
                    }
                }
                nxt.emplace_back(p.first, p.first + dif - 1);
                nxt.emplace_back(p.first + dif, p.second);
            } else {
                nxt.emplace_back(p);
            }

            types |= 1 << type;
        }

        swap(kukan, nxt);
        if (types == 4) return 2;
        if (types == 5 || types == 1) return 0;
        if (types == 6 || types == 2) return 1;
        finish(0);
        return -1;
    };

    for (int i = 61; i >= 0; i--) {
        fix[61 - i] = hoge(i);
    }

    // r以下の数で、k bit目をfix[k]にしたものの個数
    auto f = [&](long long r) -> long long {
        if (r == -1) return 0;
        // dp[i][j]: i桁見て、r未満確定か
        vector<vector<long long>> dp(63, vector<long long>(2));
        dp[0][0] = 1;
        for (int i = 0; i < 62; i++) {
            // fixが2なら自由に選べる
            // fixが0なら0を入れる
            // fixが1なら1を入れる
            vector<int> can;
            if (fix[i] == 0)
                can = {0};
            else if (fix[i] == 1)
                can = {1};
            else
                can = {0, 1};

            int bit = r >> (61 - i) & 1;
            for (int j = 0; j < 2; j++) {
                for (int k : can) {
                    if (!j && k > bit) continue;
                    dp[i + 1][j || k < bit] += dp[i][j];
                }
            }
        }
        return dp[62][0] + dp[62][1];
    };

    cout << f(r) - f(l - 1) << endl;
}