#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <stack>
#include <deque>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>

using namespace std;
#define INF 1234567890

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	int n, l;
	cin >> n >> l;
	deque<pair<int, int>> dq;
	for (int i = 1; i <= n; i++) {
		while (!dq.empty() && dq.front().second <= i - l) dq.pop_front();
		int x;
		cin >> x;
		while (!dq.empty() && dq.back().first >= x) dq.pop_back();
		dq.push_back({ x, i });
		cout << dq.front().first << " ";
	}

	return 0;
}