You are given an integer sequence a_1, a_2, ..., a_n.

Find the number of pairs of indices (l, r) (1 ≤ l ≤ r ≤ n) such that the value of median of a_l, a_{l+1}, ..., a_r is exactly the given number m.

The median of a sequence is the value of an element which is in the middle of the sequence after sorting it in non-decreasing order. If the length of the sequence is even, the left of two middle elements is used.

For example, if a=[4, 2, 7, 5] then its median is 4 since after sorting the sequence, it will look like [2, 4, 5, 7] and the left of two middle elements is equal to 4. The median of [7, 1, 2, 9, 6] equals 6 since after sorting, the value 6 will be in the middle of the sequence.

Write a program to find the number of pairs of indices (l, r) (1 ≤ l ≤ r ≤ n) such that the value of median of a_l, a_{l+1}, ..., a_r is exactly the given number m.

Input

The first line contains integers n and m (1 ≤ n,m ≤ 2⋅10^5) — the length of the given sequence and the required value of the median.

The second line contains an integer sequence a_1, a_2, ..., a_n (1 ≤ a_i ≤ 2⋅10^5).

Output

Print the required number.

Examples

Input

5 4
1 4 5 60 4


Output

8


Input

3 1
1 1 1


Output

6


Input

15 2
1 2 3 1 2 3 1 2 3 1 2 3 1 2 3


Output

97

Note

In the first example, the suitable pairs of indices are: (1, 3), (1, 4), (1, 5), (2, 2), (2, 3), (2, 5), (4, 5) and (5, 5).
/*
If you want to aim high, aim high
Don't let that studying and grades consume you
Just live life young
******************************
What do you think? What do you think?
1st on Billboard, what do you think of it
Next is a Grammy, what do you think of it
However you think, I’m sorry, but shit, I have no fcking interest
*******************************
I'm standing on top of my Monopoly board
That means I'm on top of my game and it don't stop
til my hip don't hop anymore
https://www.a2oj.com/Ladder16.html
*******************************
300iq as writer = Sad!
*/
import java.util.*;
import java.io.*;
import java.math.*;

   public class x1005E2
   {
      public static void main(String hi[]) throws Exception
      {
         BufferedReader infile = new BufferedReader(new InputStreamReader(System.in));
         StringTokenizer st = new StringTokenizer(infile.readLine());
         int N = Integer.parseInt(st.nextToken());
         int M = Integer.parseInt(st.nextToken());
         int[] arr = new int[N];
         st = new StringTokenizer(infile.readLine());
         for(int i=0; i < N; i++)
            arr[i] = Integer.parseInt(st.nextToken());
         System.out.println(solve(arr, M)-solve(arr, M+1));
      }
      public static long solve(int[] arr, int median)
      {
         long res = 0L;
         int[] temp = new int[arr.length];
         for(int i=0; i < arr.length; i++)
            temp[i] = (arr[i] < median) ? -1 : 1;
         SegmentTree segtree = new SegmentTree(-1*arr.length, arr.length);
         int sum = 0;
         for(int i=0; i < arr.length; i++)
         {
            sum += temp[i];
            segtree.update(sum, segtree.query(sum, sum)+1);
         }
         sum = 0;
         for(int i=0; i < arr.length; i++)
         {
            res += segtree.query(-1*sum+1, arr.length);
            sum -= temp[i];
            segtree.update(-1*sum, segtree.query(-1*sum, -1*sum)-1);
         }
         return res;
      }
   }
   class SegmentTree 
   {
       //range query, non lazy
       final int[] val;
       final int treeFrom;
       final int length;
   
       public SegmentTree(int treeFrom, int treeTo) 
       {
           this.treeFrom = treeFrom;
           int length = treeTo - treeFrom + 1;
           int l;
           for (l = 0; (1 << l) < length; l++);
           val = new int[1 << (l + 1)];
           this.length = 1 << l;
       }
       public void update(int index, int delta) 
       {
          //replaces value
          int node = index - treeFrom + length;
          val[node] = delta;
          for (node >>= 1; node > 0; node >>= 1) 
            val[node] = comb(val[node << 1], val[(node << 1) + 1]);
       }
       public int query(int from, int to) 
       {
          //inclusive bounds
          if (to < from)
             return 0; //0 or 1?
          from += length - treeFrom;
          to += length - treeFrom + 1;
          //0 or 1?
          int res = 0;
          for (; from + (from & -from) <= to; from += from & -from) 
              res = comb(res, val[from / (from & -from)]);
          for (; to - (to & -to) >= from; to -= to & -to)
              res = comb(res, val[(to - (to & -to)) / (to & -to)]);
          return res;
       }
       public int comb(int a, int b)
       {
          //change this
          return a+b;
       }
   }