SP25818 NEKAMELEONI - NEKAMELEONI

"Hey! I have an awesome task with chameleons, 5 th task for Saturday’s competition." "Go ahead. . . " (...) “That’s too difficult, I have an easier one, they won’t even solve that one.” “You are given an array of N integers from the interval \[1, K\]. You need to process M queries. The first type of query requires you to change a number in the array to a different value, and the second type of query requires you to determine the length of the shortest contiguous subarray of the current array that contains all numbers from 1 to K.” “Hm, I can do it in O(N^6 ). What’s the limit for N?”

The first line of input contains the integers N, K and M (1

The output must consist of the answers to the queries of the second type, each in its own line. If the required subarray doesn’t exist, output −1.