 New update is available. Click here to update.

# Find K Closest Elements

Last Updated: 17 Mar, 2021
Difficulty: Moderate

## PROBLEM STATEMENT

#### The output should also be in sorted order

##### Note:
``````An integer 'a' is closer to 'X' than an integer 'b' if:
|a - X| < |b - X|  or (  |a - X| == |b - X| and a < b )
``````
##### For Example:
``````if X = 4,  3 is closer to 'X' than 9, as |3-4| < |9-4|  i.e., 1 < 5   and if X = 4, 2 and 6 are equally close to it, as |2-4| == |6-4| = 2, but we say 2 is closer to 4 than 6, as 2 is smaller.
``````
##### Input Format:
``````The first line of the input contains ‘T’ denoting the number of test cases.

The first line of each test case contains the three integers 'N', 'K', and 'X'.

The second line of each test case contains 'N' space-separated integers of the array 'A'.
``````
##### Output Format:
``````Return the k space-separated integers.

The output of each test case is printed on a new line.
``````
##### Constraints:
``````1 <= T <= 5
1 <= N, K <= 5000
1 <= A[i], X <=10^6

Time Limit: 1 second
``````