n,K=map(int,input().split()) a=list(map(int,input().split())) z=sorted(set(a)) d={v:i for i,v in enumerate(z)} g=0 from atcoder import fenwicktree sts=fenwicktree.FenwickTree(len(d)) stc=fenwicktree.FenwickTree(len(d)) def solve(l,r): global g if l==r: v=a[l] if v+v==K: g+=1 return {v:[(1,v,1)]},{v:[(1,v,1)]} w=(r-l+1)//2 ql,_=solve(l,l+w-1) _,qr=solve(l+w,r) for lv in ql: if K-lv in qr: for x,v,c in qr[K-lv]: y=d[v] sts.add(y,x) stc.add(y,1) for x,v,c in ql[lv]: if c==1: y=d[v] g+=x*stc.sum(y+1,len(d))+sts.sum(y+1,len(d)) for x,v,c in qr[K-lv]: y=d[v] sts.add(y,-x) stc.add(y,-1) for rv in qr: if K-rv in ql: for x,v,c in ql[K-rv]: y=d[v] sts.add(y,x) stc.add(y,1) for x,v,c in qr[rv]: if c==1: y=d[v] g+=x*stc.sum(y+1,len(d))+sts.sum(y+1,len(d)) for x,v,c in ql[K-rv]: y=d[v] sts.add(y,-x) stc.add(y,-1) ql={} mv=10**10 c=1 for i in reversed(range(l,r+1)): v=a[i] if v