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)