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)
Z.sort()
ng = 0
while Z[-1][0]>0:
    #print(R)
    D = dict()
    for i in range(len(Z)):
        D[Z[i][1]] = i
    #print(D)
    c, r, COL = Z[-1]
    for col in COL:
        idx = D[col]
        Z[idx][0]-=1
        Z[idx][2].discard(r)
    Z.pop()
    #print(R)
    ng += 1
    #Z.sort()
print(N-ng)