A9122. Maximum Absurdity

The first line contains two integers $n$ and $k$ ( $2<=n<=2·10^{5}$ , $0<2k<=n$ ) — the number of laws accepted by the parliament and the length of one segment in the law list, correspondingly. The next line contains $n$ integers $x_{1},x_{2},...,x_{n}$ — the absurdity of each law ( $1<=x_{i}<=10^{9})$ .

Print two integers $a$ , $b$ — the beginning of segments that mr. Boosch should choose. That means that the president signs laws with numbers from segments $[a; a+k-1]$ and $[b; b+k-1]$ . If there are multiple solutions, print the one with the minimum number $a$ . If there still are multiple solutions, print the one with the minimum $b$ .

In the first sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[4;5\]. The total absurdity of the signed laws equals $3+6+1+6=16$ .

In the second sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[3;4\]. The total absurdity of the signed laws equals $1+1+1+1=4$ .

In the first sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[4;5\]. The total absurdity of the signed laws equals $3+6+1+6=16$ .

In the second sample mr. Boosch signs laws with numbers from segments \[1;2\] and \[3;4\]. The total absurdity of the signed laws equals $1+1+1+1=4$ .