#include <bits/stdc++.h>
using namespace std;

/**
8 3
-1 2 3 1 0 4 8 6
   i   j
-1 1 0 0 0 4

9 5
1 4 2 8 5 6 8 5 7
*/
multiset<int> M;
deque<int> q;
int a[500003];
/// O(n log k)
int main()
{
    int i, n, k;
    cin >> n >> k;
    for (i = 1; i <= n; i++)
        cin >> a[i];
    /// citesc primele k numere
    for (i = 1; i <= k; i++)
        M.insert(a[i]);
    cout << *M.begin() << " ";
    for (i = k + 1; i <= n; i++)
    {
        M.insert(a[i]);
        M.erase(a[i - k]);
        cout << *M.begin() << " ";
    }
    return 0;
}