//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }

} // namespace n91

#include <algorithm>
#include <bitset>
#include <iostream>
#include <limits>
#include <string>
#include <utility>

namespace n91 {

  void main_() {
    using bs = std::bitset<61>;
    const usize n{ scan<usize>() };
    const u64 ll{ scan<u64>() };
    const u64 rr{ scan<u64>() };
    std::vector<bs> a(n);
    for (auto& e : a) {
      e = scan<u64>();
    }
    std::vector<int> state(61, 3);
    bool no_sat = false;
    const auto solve = [&](const auto& solve, const usize l, const usize r,
      const usize p) {
        if (l == r) {
          return;
        }
        if (p >= 61) {
          return;
        }
        usize zero = 0, one = 0;
        for (const auto i : rep(l, r)) {
          if (a[i].test(p)) {
            ++one;
          }
          else {
            ++zero;
          }
        }
        if (zero != 0 && one != 0) {
          bool zo = true;
          for (const auto i : rep(l, l + zero)) {
            if (a[i].test(p)) {
              zo = false;
            }
          }
          if (zo) {
            if (state[p] % 2 == 0) {
              no_sat = true;
              return;
            }
            state[p] = 1;
            solve(solve, l, l + zero, p - 1);
            solve(solve, r - one, r, p - 1);
          }
          else {
            bool oz = true;
            for (const auto i : rep(l, l + one)) {
              if (!a[i].test(p)) {
                oz = false;
              }
            }
            if (oz) {
              if (state[p] / 2 == 0) {
                no_sat = true;
                return;
              }
              state[p] = 2;
              solve(solve, l, l + one, p - 1);
              solve(solve, r - zero, r, p - 1);
            }
            else {
              no_sat = true;
              return;
            }
          }
        }
        else {
          solve(solve, l, r, p - 1);
        }
    };
    solve(solve, 0, n, 60);
    if (no_sat) {
      std::cout << 0 << std::endl;
      return;
    }

    const auto f = [&state](const bs x) {
      u64 t = 1, d = 0;
      for (const auto i : revrep(0, 61)) {
        u64 nt = 0, nd = 0;
        if (x.test(i)) {
          if (state[i] % 2 != 0) {
            nd += t;
            nd += d;
          }
          if (state[i] / 2 != 0) {
            nt += t;
            nd += d;
          }
        }
        else {
          if (state[i] % 2 != 0) {
            nt += t;
            nd += d;
          }
          if (state[i] / 2 != 0) {
            nd += d;
          }
        }
        t = nt;
        d = nd;
      }
      return d + t;
    };
    u64 ans = f(rr);
    if (ll != 0) {
      ans -= f(ll - 1);
    }
    std::cout << ans << std::endl;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}