import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#n = int(input())
#
#alist = []
#s = input()
n,l,r = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
alist = list(map(int,input().split()))
alist.sort()
ans = 1
temp = 1
mi = -1
for i in range(n-1):
    if l <= alist[i] * alist[i+1] <= r and (mi == -1 or l <= mi * alist[i+1] <= r):
        temp += 1
        if temp == 2:
            mi = alist[i]
    else:
        ans = max(ans,temp)
        temp = 1
        mi = -1
ans = max(ans,temp)
#print(alist)
print(ans)