B'Given an array a of length n and an integer k , you are tasked to find any two numbers l and r ( l <= q r ) such that: If no numbers satisfy the conditions, output -1. For example, if a=[11, 11, 12, 13, 13, 14, 14] and k=2 , then: A pair of l and r for which the first condition holds and r-l is maximal is l = 13 , r = 14 . The first line of the input contains a single integer t ( 1 <= t <= 1000 ) -- the number of test cases. The description of test cases follows. The first line of each test case contains the integers n and k ( 1 <= n <= 2 cdot 10^5 , 1 <= q k <= q n ) -- the length of the array a and the minimum amount of times each number in the range [l, r] should appear respectively. Then a single line follows, containing n integers describing the array a ( 1 <= q a_i <= q 10^9 ). It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^5 . For each test case output 2 numbers, l and r that satisfy the conditions, or "-1" if no numbers satisfy the conditions. If multiple answers exist, you can output any. '...