In a company there are $$$n$$$ employees. The skill level of the $$$i$$$-th employee is denoted by an integer $$$a_i$$$.
The company wants to start a new project, which requires some of the $$$n$$$ employees. A project is considered balanced if the difference in skill between any two employees assigned to the project is at most $$$k$$$.
For every $$$i$$$ from $$$1$$$ to $$$n$$$, print the maximum number of employees that can be part of a balanced project which contains employee $$$i$$$.
The first line of input contains two integers $$$n$$$ and $$$k$$$ ($$$1 \le n \le 2 \cdot 10^5$$$, $$$0 \le k \le 10^9$$$).
The second line of input contains $$$n$$$ integers $$$a_1,a_2,\ldots,a_n$$$ ($$$1 \le a_i \le 10^9$$$) — the skill levels of the $$$n$$$ employees.
For every $$$i$$$ from $$$1$$$ to $$$n$$$, print the maximum number of employees that can be part of a balanced project which contains employee $$$i$$$.
6 2 1 2 3 4 6 9
3 3 3 3 2 1
15 78 98 190 175 67 109 139 297 175 789 162 109 87 165 243 72
8 6 8 7 8 8 2 8 1 8 8 7 8 5 7
Explanation of the first testcase: