#include<bits/stdc++.h>
using namespace std;
#define int long long
int n,k;
priority_queue<int,vector<int>,greater<int>>q;
void solve()
{
	cin>>n>>k;
	for(int i=1;i<=n;i++)
	{
		int x;cin>>x;
		q.push(x);
		if(q.size()>k)q.pop();
		if(q.size()==k)cout<<q.top()<<'\n';
	}
	while(!q.empty())q.pop();
}
signed main()
{
	solve();
	return 0;
}