Given a 1-indexed array of integers, consider all subarrays of size . A subarray is good if the range of the subarray is at most . Compute all good subarrays.
The first line will contain three space-separated integers, , , and .
The next line contains space-separated integers, the in order comprising the list.
Output, on separate lines, all starting indices of good subarrays. Print exactly one per line, and print them in increasing order.
If no subarrays are good, output
7 2 0 0 1 1 2 3 2 2