The sum is not without variety#1876
Given a sequence of integers A_1, A_2, \ldots, A_N.
You need to select a subsequence of consecutive numbers, A_i, A_{i+1}, \ldots, A_j, such that it contains at least distinct numbers and the sum S = A_i + A_{i+1} + \ldots + A_j is maximized.
The first line contains two integers and (1 \leq K \leq N \leq 200000).
The second line contains integers A_1, A_2, \ldots, A_N (|A_i| \leq 1000000000).
Print the maximum possible value of the sum on the first line. On the second line, print the indices of the first and last elements of the found optimal subsequence. If there are multiple solutions, any of them is acceptable.
If there is no subsequence that meets the requirements, print a single line with the word "IMPOSSIBLE" (without quotes).
Example 1