123

#include <iostream>
#include <algorithm>
#include <vector>
#include <fstream>
using namespace std;
int k, n, W[100000];
vector <int> in, ans;

 //f2 ("output.txt");
int main()
{
    freopen ("d2.txt", "r", stdin);
    freopen ("output.txt", "w", stdout);
     //cin >> n >> k;
    for (int i = 0; i < n; i++) {
        f1 >> W[i];
    }
    for (int i = 0; i < k; i++) {
        in.push_back(W[i]);
    }
    sort(in.begin(), in.end());
    for (int i = k; i < n; i++) {
        ans.push_back(in[k / 2]);
        in.erase(lower_bound(in.begin(), in.end(), W[i - k]));
        in.insert(lower_bound(in.begin(), in.end(), W[i]), W[i]);
    }
    ans.push_back(in[k / 2]);
    for (int x : ans)
        cout << x << ' ';
    return 0;
}