pub mod scanner {

    pub struct Scanner {
        buf: Vec<String>,
    }

    impl Scanner {
        pub fn new() -> Self {
            Self { buf: vec![] }
        }

        pub fn new_from(source: &str) -> Self {
            let source = String::from(source);
            let buf = Self::split(source);
            Self { buf }
        }

        pub fn next<T: std::str::FromStr>(&mut self) -> T {
            loop {
                if let Some(x) = self.buf.pop() {
                    return x.parse().ok().expect("");
                }
                let mut source = String::new();
                std::io::stdin().read_line(&mut source).expect("");
                self.buf = Self::split(source);
            }
        }

        fn split(source: String) -> Vec<String> {
            source
                .split_whitespace()
                .rev()
                .map(String::from)
                .collect::<Vec<_>>()
        }
    }
}

use crate::scanner::Scanner;
use std::io::Write;
fn main() {
    let mut scanner = Scanner::new();
    let out = std::io::stdout();
    let mut out = std::io::BufWriter::new(out.lock());
    let t: usize = 1;
    for _ in 0..t {
        solve(&mut scanner, &mut out);
    }
}
fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {
    let n = scanner.next::<usize>();
    let l = scanner.next::<isize>();
    let r = scanner.next::<isize>();
    let mut a = (0..n).map(|_| scanner.next::<isize>()).collect::<Vec<_>>();
    a.sort();
    let mut ans = 1;
    for i in 0..n - 1 {
        for j in i + 1..n {
            let b = a[i] * a[j];
            if l <= b && b <= r {
                ans = ans.max(2);
            } else {
                continue;
            }
            let mut ok = true;
            {
                let b = a[i] * a[i + 1];
                ok &= l <= b && b <= r;
            }
            {
                let b = a[j - 1] * a[j];
                ok &= l <= b && b <= r;
            }
            if ok {
                ans = ans.max(j - i + 1);
            }
        }
    }
    writeln!(out, "{}", ans).unwrap();
}