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