from bisect import bisect_right
N,K = map(int,input().split())
A = sorted(list(map(int,input().split())))
ans = 0
for i in range(N):
    ind = bisect_right(A,(2*K-1)//A[i])
    ans += N-ind
print(ans)