#include <iostream>
#include <map>

using namespace std;

int n, k;
short int a[150000];
map<int, int> m;

int main()
{
	cin >> n >> k;
	for (int i = 0; i < n; ++i)
		cin >> a[i];
	for (int i = 0; i < k; ++i)
		m[a[i]]++;
	cout << m.begin()->first << " ";
	for (int i = k; i < n; ++i)
	{
		m[a[i - k]]--;
		if (m[a[i - k]] == 0)
			m.erase(m.find(a[i - k]));
		m[a[i]]++;
		cout << m.begin()->first << " ";
	}

	return 0;
}