from bisect import bisect_left as bl , bisect_right as br

n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=0

def  c(x,y):
    return x*y / 2 >= k

def  nb(x):
    ng = 1 
    ok = 10**10
    while ok - ng > 1:
        mid=(ok + ng) / 2
        if c(x,mid):
            ok = mid
        else:
            ng = mid
    return ok
for i in range(n):
    t=nb(a[i])
    ans+= n - bl(a,t)
    
print(ans)