Nine degrees 1371 the smallest number of K

Title Description: Enter n integers to find the smallest number of K. For example, enter 4,5,1,6,2,7,3,8 these 8 numbers, then the smallest 4 number is 1,2,3,4,.

Input:

Each test case consists of 2 rows: The first behavior is 2 integers n,k (1<=n,k<=200000), which represents the length of the array.

The second line contains n integers, representing the number of N, and the range of numbers in the array is [0,1000 000 000].

Output:

For each test case, output the minimum number of K and print from small to large order.

Sample input:

8 44 5 1 6 2 7 3 8

Sample output:

1 2 3 4

The difference between this problem is that the final output needs to be sorted, which is generally not required.

Nine degrees 1371 the smallest number of K