import sys

sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")

def main():
    def bitdp(lr):
        if lr == -1: return 0
        dp = [[0] * 2 for _ in range(max_k + 1)]
        dp[0][0] = 1
        for i in range(max_k):
            lri = (lr >> (max_k - 1 - i)) & 1
            for f in range(2):
                pre = dp[i][f]
                if pre == 0: continue
                nf = f
                if dig[i] < 1 and (f == 1 or lri == 1):
                    dp[i + 1][nf] += pre
                if dig[i] > -1:
                    if lri == 1: nf = 1
                    dp[i + 1][nf] += pre
        # p2D(dp)
        return sum(dp[max_k])

    max_k = 61
    n, l, r = map(int, input().split())
    aa = list(map(int, input().split()))
    # p2D(aa)
    dig = [0] * max_k  # 1昇順　-1降順　0どちらでも
    for a0, a1 in zip(aa, aa[1:]):
        for i in range(max_k):
            a0k = (a0 >> (max_k - 1 - i)) & 1
            a1k = (a1 >> (max_k - 1 - i)) & 1
            if a0k != a1k:
                if dig[i] == a0k - a1k:
                    print(0)
                    exit()
                else:
                    dig[i] = a1k - a0k
                    break
    # print(dig)
    print(bitdp(r) - bitdp(l - 1))

main()