import bisect

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

ans = 0

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

print(ans)