A scanner reads n part IDs off a conveyor in order. Quality control slides a window of exactly k consecutive scans and, for each window position, needs the number of distinct part IDs inside that window.
Output the count of distinct part IDs in every contiguous window of size k, from the leftmost window to the rightmost.
Input format
Line 1: two integers n and k.
Line 2: n space-separated integers, the part IDs in scan order.
Output format
One line with n - k + 1 space-separated integers: the distinct-ID count of each window, left to right.
Constraints
- 1 <= k <= n <= 100000
- 0 <= each part ID <= 1000000000