MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from bisect import bisect_left,bisect_right

def main():
    n,x = map(int,input().split())
    a = list(map(int,input().split()))
    a.sort()

    ans = 0
    for num in a:
        ans += bisect_right(a,x - num) - bisect_left(a,x - num)
    print(ans)
if __name__ == '__main__':
    main()