#include <algorithm>
#include <iostream>
#include <vector>
using namespace std;

int main() {
    int num,k;
    cin>>num;
    cin>>k;
    int tem;
    vector<int> store;
    while(cin>>tem){
        store.push_back(tem);
    }
    sort(store.begin(),store.end());
    for(int i =0;i<k;i++){
        cout<<store[i]<<' ';
    }
}
// 应该用最小堆实现，有O(logn)时间复杂度