Postcard

During his winter holiday in the mountains, Wojtek bought a huge postcard showing a mountain panorama. Back home he framed it and hung it on the wall to admire every day, but after a few weeks he grew tired of the view.

Just as the souvenir was about to be stored away in the attic, Wojtek had a clever idea: cut off a few mountains from the left and a few from the right to obtain a new, more striking panorama. If he cuts away too much, though, the new view could look dull, so he wants at least one mountain of height at least $m$ to remain after cutting.

The mountains stand in a row. Removing $0$ or more from the left and $0$ or more from the right leaves a contiguous segment of mountains in the middle. Among all such segments (two compositions are different when the position range of the remaining mountains differs), count how many are non-empty and contain at least one mountain of height at least $m$. The case where Wojtek cuts nothing and leaves the postcard unchanged also counts, as long as it contains a mountain of height at least $m$.

The first line contains two integers $n$ and $m$ ($1 \le n \le 1\,000\,000$, $1 \le m \le 1\,000\,000\,000$), separated by a single space. They denote the number of mountains on the postcard and the minimum height of a mountain that makes the panorama striking, respectively.

The second line contains $n$ integers $h_i$ ($1 \le h_i \le 1\,000\,000\,000$), separated by single spaces. They are the heights of the mountains from left to right, and all heights are distinct ($h_i \ne h_j$ for $i \ne j$).

Print a single integer: the number of compositions that satisfy the conditions.

For example, if the heights from the left are 80 102 90 98 100 and $m = 100$, the following eleven compositions satisfy the conditions.

80 102 90 98 100
102 90 98 100
90 98 100
98 100
100
80 102 90 98
80 102 90
80 102
102 90 98
102 90
102