def cal(a,X,N):
    count=0
    for i in range(N-1):
        if(a[i]<=X):
            for j in range(i,N):
                sum=a[i]+a[j]
                if(sum>X):
                    break
                elif(sum==X):
                    count+=1
                    if(i!=j):
                        count+=1
    return count

N,X=list(map(int,input().split()))
a=list(map(int,input().split()))

a_sort=sorted(a)
print(cal(a_sort,X,N))