Fliperama Quicksort

array=[]
n,m = map(int,raw_input().split())
for i in range(n):
    p = int(raw_input())
    array.append(p)
def sort(array):
    less = []
    equal = []
    greater = []

    if len(array) > 1:
        pivot = array[0]
        for x in array:
            if x > pivot:
                less.append(x)
            if x == pivot:
                equal.append(x)
            if x < pivot:
                greater.append(x)
        return sort(less)+equal+sort(greater)
    else:
        return array
array = sort(array)
for i in range(m):
    print array[i]