#int(input())
#map(int, input().split())
#list(map(int, input().split()))

from bisect import bisect, bisect_left
N, L, R = map(int, input().split())
A = list(map(int, input().split()))

A = sorted(A)

ans = 1
t = 1
for i in range(N-1):
    p = A[i] * A[i+1]
    if L <= p and p <= R:
        t += 1
    else:
        ans = max(t, ans)
        t = 1

ans = max(ans, t)

print(ans)