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