Tours

Anton will go on vacation soon. He will spend $k$ consecutive days on vacation. By the terms of his job, these must be some of the nearest $n$ days.

Anton plans to spend his vacation on guided tours. The tour office runs exactly one tour each day. On day $i$, the tour goes to city $a_i$. Cities on the planet are positive integers not exceeding $10^9$. The office may run tours to the same city several times.

Anton likes to visit new places. Choose the vacation days so that he can visit the largest possible number of distinct cities during the vacation.

The first line contains two integers $n$ and $k$ ($1 \le k \le n \le 10^5$), where $n$ is the number of days from which the vacation can be chosen and $k$ is the vacation length. The second line contains $n$ integers $a_i$ ($1 \le a_i \le 10^9$), the cities of the tours on each day. Days are numbered from 1.

Print one integer $x$ ($1 \le x \le n - k + 1$), the number of the first day of the best vacation. If several answers exist, print any of them.