import bisect

n, k = map(int, input().split())
A = list(map(int, input().split()))
A.sort()

cnt = 0

for a in A:
    cnt += n - bisect.bisect_left(A, (2*k+a-1) // a)
 
print(cnt)