The measure of a man lies not in what he says but what he does.

Superman needs to solve a problem in order to decipher Bizarro's weird language and save the day. Help him solve the problem.

Given an array A of n integers, how many triplets $(a, b, c)$ exist that satisfy the formula $a + b + c = k$ and $a, b, c \in A$.

INPUT

First line of input contains n, the number of elements in the array and k, the value k in the formula

The next line of input contains n integers, $a_1, a_2, ... a_n$, representing the array of numbers.

OUTPUT

Print the answer to the problem. It is guaranteed that the answer will fit inside a 64 bit integer.

CONSTRAINTS

$3 \leq n \leq 1000$

$1 \leq a_i \leq 10^6$

$1 \leq k \leq 10^6$

All the numbers in array A are distinct.