import java.io.IOException;
import java.io.InputStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.NoSuchElementException;

class Main {
	public static void main(String[] args) {
		new Main().run();
	}
	
	int b(long v,int pos) {
		return (int)((v>>pos)%2);
	}
	
	void fail() {
		System.out.println(0);
		System.exit(0);		
	}
	
	ArrayList<Integer>[] v=new ArrayList[61];
	{
		for(int i=0;i<v.length;++i) {
			v[i]=new ArrayList<Integer>(List.of(0,1));
		}
	}

	void dfs(int l,int r,int pos,long[] A) {
		if(pos<0)return;
		int m=l+1;
		while(m<r&&b(A[m-1],pos)==b(A[m],pos))++m;
		boolean ok=true;
		for(int i=l;i<m;++i)ok&=b(A[i],pos)==b(A[l],pos);
		for(int i=m;i<r;++i)ok&=b(A[i],pos)==b(A[m],pos);
		if(!ok)fail(); 
		if(m==r) {
			//どちらもでもよい
		}else {
			v[pos].remove(Integer.valueOf(b(A[l],pos)^1));
		}
		if(m!=l)dfs(l,m,pos-1,A);
		if(m!=r)dfs(m,r,pos-1,A);
	}
	
	long f(long N) {
		long[][] dp=new long[62][2];
		dp[0][1]=1;
		for(int i=0;i+1<dp.length;++i) {
			for(int eq=0;eq<=1;++eq) {
				for(int val:v[60-i]) {
					if(eq==1&&b(N,60-i)<val)continue;
					int neq=eq&(val==b(N,60-i)?1:0);
					int ni=i+1;
					dp[ni][neq]+=dp[i][eq];
				}
			}
		}
		return Arrays.stream(dp[61]).sum();
	}
	
	// i != j => A_i != A_j
	
	void run() {
		FastScanner sc=new FastScanner();
		int N=sc.nextInt();
		long L=sc.nextLong();
		long R=sc.nextLong();
		long[] A=new long[N];
		for(int i=0;i<N;++i) {
			A[i]=sc.nextLong();
		}
		dfs(0,N,60,A);
		System.out.println(f(R)-f(L-1));
	}

	static void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}

}




class FastScanner {
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
    private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
    public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
    public String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }
    public long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    public int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    public double nextDouble() { return Double.parseDouble(next());}
}