import bisect
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=0
for i in range(n):
    ans+=n-bisect.bisect_left(a,2*k/a[i])
print(ans)