B"You are given an integer array a of size n . You have to perform m queries. Each query has one of two types: The first line contains two integers n and m ( 1 <= n, m <= 10^5 ) -- the size of the array a and the number of queries. The second line contains n integers a_1, a_2, ... , a_n ( 1 <= a_i <= 10^5 ). Next m lines contain queries (one per line). Each query has one of two types: It's guaranteed that there is at least one query of the first type. For each query of the first type, print the minimum value of dif that satisfies all required conditions, or -1 if it is impossible to choose k distinct integers. "...