CF993E.Nikita and Order Statistics

Nikita likes tasks on order statistics, for example, he can easily find the $k$-th number in increasing order on a segment of an array. But now Nikita wonders how many segments of an array there are such that a given number $x$ is the $k$-th number in increasing order on this segment. In other words, you should find the number of segments of a given array such that there are exactly $k$ numbers of this segment which are less than $x$.

Nikita wants to get answer for this question for each $k$ from $0$ to $n$, where $n$ is the size of the array.

尼基塔喜欢与顺序统计相关的题目，例如，他能轻松地找出数组某一段中按升序排列的第 $k$ 个数。但现在尼基塔想知道：对于给定的数组，有多少个子数组满足——在该子数组中，给定的数 $x$ 恰好是按升序排列的第 $k$ 个数。换句话说，你需要找出满足如下条件的子数组个数：该子数组中严格小于 $x$ 的数恰好有 $k$ 个。

尼基塔希望对每个 $k$（从 $0$ 到 $n$）都得到该问题的答案，其中 $n$ 是数组的长度。

The first line contains two integers $n$ and $x$ $(1 \le n \le 2 \cdot 10^5, -10^9 \le x \le 10^9)$.

The second line contains $n$ integers $a_1, a_2, \ldots, a_n$ $(-10^9 \le a_i \le 10^9)$ — the given array.

第一行包含两个整数 $n$ 和 $x$ $(1 \le n \le 2 \cdot 10^5, -10^9 \le x \le 10^9)$。

第二行包含 $n$ 个整数 $a_1, a_2, \ldots, a_n$ $(-10^9 \le a_i \le 10^9)$ —— 给定的数组。

Print $n+1$ integers, where the $i$-th number is the answer for Nikita's question for $k=i-1$.

输出 $n+1$ 个整数，其中第 $i$ 个数是 Nikita 关于 $k=i-1$ 的问题的答案。