#yuki1882
import bisect
n,k=map(int,input().split())
l=sorted(map(int,input().split()))
res=0
for i in l:
 res+=n-bisect.bisect_left(l,2*k/i)
print(res)