Maximum

Let's define a fragment of a numerical sequence as any non-empty contiguous subsequence of that sequence. For instance, in the sequence of numbers $1,7,3$, the fragments include the entire sequence $1,7,3$, the two-element subsequences $1,7$ and $7,3$ (but not the subsequence $1,3$), as well as the single-element subsequences $1$, $7$, and $3$.

Task

Write a program that, given a sequence of numbers and a value $M$, calculates how many fragments of the sequence have a maximum value equal to $M$. Note that fragments with the same numbers but in different positions in the sequence are considered distinct.