import heapq
import sys
input = sys.stdin.readline
N, L, R = map(int, input().split())
A = list(map(int, input().split()))
S = [[0 for _ in range(N)] for _ in range(N)]
F = [[0 for _ in range(N)] for _ in range(N)]
for i in range(N):
    for j in range(N):
        S[i][j] = A[i]*A[j]
        if i==j or L<=S[i][j]<=R:
            F[i][j]=1
#print(F)
R = [[0, i, set()] for i in range(N)]
for i in range(N):
    for j in range(N):
        if F[i][j]==0:
            R[i][0]-=1
            R[i][2].add(j)
heapq.heapify(R)
ng = 0
while R[0][0]<0:
    #print(R)
    D = dict()
    for i in range(len(R)):
        D[R[i][1]] = i
    #print(D)
    c, r, COL = R[0]
    for col in COL:
        idx = D[col]
        R[idx][0]+=1
        R[idx][2].discard(r)
    heapq.heappop(R)
    #print(R)
    ng += 1
    heapq.heapify(R)
print(N-ng)