A vending machine dispenses one of several ice-cream flavor codes (integers, which may repeat and may be negative, since they are just IDs) every minute, for n minutes total. For a fixed window length k, consider every contiguous window of k consecutive minutes.
For each window, count the number of DISTINCT flavor codes dispensed within it.
Print all counts, in order, one per window, space separated on a single line (there are n - k + 1 counts).
Input format
Line 1: two integers n and k.
Line 2: n space-separated integers, the flavor codes.
Output format
n - k + 1 space-separated integers: the distinct-flavor count of each window, in order.
Constraints
- 1 <= k <= n <= 100000
- -1000000 <= each code <= 1000000