Given an array of $n$ and a number $d$. 

Your task is to find a segment of length at least $d$, on which the arithmetic mean of the elements is maximum possible.

The first line contains two integers $n,d\ (1≤d≤n≤10^5)$. 

The next line contains $n$ integers $a_i$, the elements of array $(0≤a_i≤100)$.

Print two integers, indices of the first and last elements of the required segment (elements are numbered starting from 1).