import sys

# sys.setrecursionlimit(200005)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 63)
# md = 10**9+7
md = 998244353

n, l, r = LI()
aa = LI()
aa.sort()

dp = [[0]*n for _ in range(n)]
for i in range(n):
    dp[i][i]=1
    for j in range(i):
        if l <= aa[i]*aa[j] <= r: dp[i][j] = dp[j][i] = 1

for i in range(n-1):
    for j in range(n-1):
        if dp[i+1][j+1]==0:continue
        dp[i+1][j+1]=min(dp[i][j],dp[i+1][j],dp[i][j+1])+1

ans=max(dp[i][i] for i in range(n))
print(ans)