B"Pak Chanek has just bought an empty fish tank and he has been dreaming to fill it with his favourite kind of fish, clownfish. Pak Chanek likes clownfish because of their ability to change their genders on demand. Because of the size of his fish tank, Pak Chanek wants to buy exactly k clownfish to fill the tank. Pak Chanek goes to the local fish shop. The shop provides n clownfish numbered from 1 to n , with clownfish i having a size of a_i . Initially, every clownfish in the store does not have an assigned gender, but has the ability to be assigned to two possible clownfish genders, female or male. The store has a procedure which Pak Chanek should follow to buy clownfish. The shop owner will point at each clownfish sequentially from 1 to n and for each clownfish, she asks Pak Chanek whether to buy it or not. Each time Pak Chanek is asked, he must declare whether to buy the currently asked clownfish or not, before the shop owner moves on to the next clownfish. If Pak Chanek declares to buy the currently asked clownfish, he must also declare the gender to be assigned to that clownfish immediately. When assigning the gender for the currently asked clownfish, the following conditions must be satisfied: Pak Chanek wants to buy exactly k clownfish such that: Let l and r respectively be the minimum and maximum index of a clownfish Pak Chanek buys. What is the minimum possible value of r-l ? The first line contains two integers n and k ( 2 <= q k <= q n <= q 2 cdot10^5 ) -- the number of clownfish in the shop and the number of clownfish Pak Chanek has to buy. The second line contains n integers a_1,a_2,a_3, ldots,a_n ( 1 <= q a_i <= q n ) -- the size of each clownfish. An integer representing the minimum possible value of r-l . If it is impossible to buy exactly k clownfish and satisfy the problem's condition, print -1 . In the first example, Pak "...