import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum E = 61;

int N;
long L, R;
long[] A;

int[] con;

void main() {
  try {
    for (; ; ) {
      N = readInt();
      L = readLong();
      R = readLong();
      A = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong();
      }
      
      con = new int[E];
      foreach (i; 0 .. N - 1) {
        const e = bsr(A[i] ^ A[i + 1]);
        if ((A[i] >> e) & 1) {
          con[e] |= 2;
        } else {
          con[e] |= 1;
        }
      }
      debug {
        writeln("con = ", con);
      }
      
      auto dp = new long[][][](E + 1, 2, 2);
      dp[E][0][0] = 1;
      foreach_reverse (e; 0 .. E) {
        foreach (s; 0 .. 2) foreach (t; 0 .. 2) {
          foreach (x; 0 .. 2) {
            if (s || ((L >> e) & 1) <= x) {
              if (t || (x <= ((R >> e) & 1))) {
                if (!((con[e] >> (x ^ 1)) & 1)) {
                  int ss = s, tt = t;
                  if (((L >> e) & 1) < x) ss = 1;
                  if (x < ((R >> e) & 1)) tt = 1;
                  dp[e][ss][tt] += dp[e + 1][s][t];
                }
              }
            }
          }
        }
      }
      long ans;
      foreach (s; 0 .. 2) foreach (t; 0 .. 2) {
        ans += dp[0][s][t];
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}