from bisect import bisect_left

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

ans = 0
for i in range(n):
    res = (k + A[i] - 1) // A[i]
    idx = bisect_left(A, res)
    ans += n - idx
print(ans)