Given a list ~A~ of ~N~ integers, compute the number of triples ~(i, j, k)~ with ~i < j < k~ such that the median of ~A_i~, ~A_j~, and ~A_k~ is ~X~.
~1 \le N, X \le 100~
~1 \le a_i \le 100~
The first line of the input consists of two space-separated integers, ~N~ and ~X~.
The next line contains ~N~ space-separated integers, the values ~A_1~ through ~A_N~ representing the ~N~ numbers of the list in order.
Output, on a single line, the number of valid triples.
4 1 1 1 2 2