#include<iostream> using namespace std; int n,k,a[100001]; void qs(int a[],int left,int right){ int i=left,j=right; int mid=a[(left+right)/2]; while(i<=j){ while(a[i]>mid) i++; while(a[j]<mid) i--; if(i<=j){ int tmp=a[i]; a[i]=a[j]; a[j]=tmp; i++; j--; } if(left<j) qs(a,left,j); if(i<right) qs(a,i,right); return ; } } int main(){ cin>>n; for(int i=1;i<=n;i++){ cin>>a[i]; } cin>>k; qs(a,1,n); for(int i=1;i<=k;i++){ cout<<a[i]<<endl; } return 0; }