package main import ( "bufio" "fmt" "io" "math/bits" "os" "strconv" ) var iost *Iost type Iost struct { Scanner *bufio.Scanner Writer *bufio.Writer } func NewIost(fp io.Reader, wfp io.Writer) *Iost { const BufSize = 2000005 scanner := bufio.NewScanner(fp) scanner.Split(bufio.ScanWords) scanner.Buffer(make([]byte, BufSize), BufSize) return &Iost{Scanner: scanner, Writer: bufio.NewWriter(wfp)} } func (i *Iost) Text() string { if !i.Scanner.Scan() { panic("scan failed") } return i.Scanner.Text() } func (i *Iost) Atoi(s string) int { x, _ := strconv.Atoi(s); return x } func (i *Iost) GetNextInt() int { return i.Atoi(i.Text()) } func (i *Iost) Atoi64(s string) int64 { x, _ := strconv.ParseInt(s, 10, 64); return x } func (i *Iost) GetNextInt64() int64 { return i.Atoi64(i.Text()) } func (i *Iost) Atof64(s string) float64 { x, _ := strconv.ParseFloat(s, 64); return x } func (i *Iost) GetNextFloat64() float64 { return i.Atof64(i.Text()) } func (i *Iost) Print(x ...interface{}) { fmt.Fprint(i.Writer, x...) } func (i *Iost) Printf(s string, x ...interface{}) { fmt.Fprintf(i.Writer, s, x...) } func (i *Iost) Println(x ...interface{}) { fmt.Fprintln(i.Writer, x...) } func isLocal() bool { return os.Getenv("NICKEL") == "BACK" } func main() { fp := os.Stdin wfp := os.Stdout if isLocal() { fp, _ = os.Open(os.Getenv("WELL_EVERYBODY_LIES_TOO_MUCH")) } iost = NewIost(fp, wfp) defer func() { iost.Writer.Flush() }() solve() } func solve() { n := iost.GetNextInt() l := iost.GetNextInt() r := iost.GetNextInt() aa := make([]int, n) for i := 0; i < n; i++ { aa[i] = iost.GetNextInt() } xx := make([][2]bool, 61) for i := 0; i < n-1; i++ { for j := 60; j >= 0; j-- { if aa[i]>>uint(j)&1 != aa[i+1]>>uint(j)&1 { xx[60-j][aa[i+1]>>uint(j)&1] = true break } } } ans := f(r, aa, xx) - f(l-1, aa, xx) if l == 0 { ans++ for i := 0; i < n-1; i++ { if aa[i] >= aa[i+1] { ans-- break } } } iost.Println(ans) } func f(r int, aa []int, xx [][2]bool) int { if r <= 0 { return 0 } m := bits.Len(uint(r)) dp := make([][2]int, 62) rr := make([]int, 61) for i := 0; i < 61; i++ { rr[60-i] = r >> uint(i) & 1 } dp[61][0] = 1 ans := 0 least := 60 for i := 0; i < 61; i++ { if xx[i][0] { least = i break } } for i := 60; i > 60-m; i-- { for j := 0; j < 2; j++ { for k := 0; k < 2; k++ { if xx[i][k] { continue } tj := 0 if rr[i]-j < k { tj = 1 } dp[i][tj] += dp[i+1][j] if k == 0 { continue } if least < i { continue } if i > 61-m || tj == 0 { ans += dp[i+1][j] } } } } return ans }