 K larger values ||
Easy Accuracy: 53.19% Submissions: 463 Points: 2

Given an array arr of integers of size N and an integer K, the task is to find the K distinct larger values of the array. If there are less than K distinct values in the array print -1.

Input:
1. The first line of the input contains a single integer T denoting the number of test cases. The description of T test cases follows.
2. The first line of each test case contains two space-separated integers N and K
3. The second line contains
N space-separated positive integers represents array arr.

Output: For each test case, print K space-separated values in decreasing order

Constraints:
1. 1 <= T <= 10

2. 1 <= K <= N <= 100000
3. 1 <= arr[i] <= 10^9

Example:
Input:

3
3 2
4 1 3

4 3
4 8 1 8
4 4
4 8 1 8

Output:
4 3
8 4 1

-1

We are replacing the old Disqus forum with the new Discussions section given below.

### Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

#### My Submissions:  