#include <fstream>
#include <iostream>
#include <set>
using namespace std;

const int N = 5e5 + 5;

ifstream fin ("secventa.in");
ofstream fout ("secventa.out");

multiset <int> deque;
int v[N], n, k, MAX = -1e9, a, b;

int main() {
	fin >> n >> k;
	for (int i = 0; i < n; ++i) {
		fin >> v[i];
		if (i < k)
			deque.insert(v[i]);
	}
	fin.close();
	for (int i = 0; i <= n - k; ++i) {
		if (MAX < *(deque.begin())) {
			MAX = *(deque.begin());
			a = i;
			b = i + k;
		}
		cout << i << " " << MAX << "\n";
		deque.erase (v[i]);
		deque.insert (v[i+k]);
	}
	for (int i = a; i < b; ++i)
		fout << v[i] << " ";
	fout.close();
}