#include <iostream>
#include <algorithm>
using namespace std;
int compare (int a, int b)
{
return a < b;
}
int main()
{
int l, k, p = 1;
cin >> l >> k;
int *tab = new int[l];
for (int i = 0; i < l; i++)
cin >> tab[i];
sort(tab, tab+l, compare);
if (k == 1)
cout << tab[l - 1] << endl;
else
{
while (p <= k)
{
cout << tab[l - 1] << endl;
l--;
p++;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwogCmludCBjb21wYXJlIChpbnQgYSwgaW50IGIpCnsKICByZXR1cm4gYSA8IGI7Cn0KIAogCmludCBtYWluKCkKewogICAgaW50IGwsIGssIHAgPSAxOwogICAgY2luID4+IGwgPj4gazsKICAgIGludCAqdGFiID0gbmV3IGludFtsXTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbDsgaSsrKQogICAgICAgIGNpbiA+PiB0YWJbaV07CiAgICBzb3J0KHRhYiwgdGFiK2wsIGNvbXBhcmUpOwogICAgaWYgKGsgPT0gMSkKICAgICAgICBjb3V0IDw8IHRhYltsIC0gMV0gPDwgZW5kbDsKICAgIGVsc2UKICAgIHsKICAgICAgICB3aGlsZSAocCA8PSBrKQogICAgICAgIHsKICAgICAgICAgICAgY291dCA8PCB0YWJbbCAtIDFdIDw8IGVuZGw7CiAgICAgICAgICAgIGwtLTsKICAgICAgICAgICAgcCsrOwogICAgICAgIH0KICAgIH0KCXJldHVybiAwOwp9