#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pld = pair<ld, ld>;

#define fi first
#define se second
#define pb push_back
#define pf push_front
#define mp make_pair
#define ins insert
#define btpc __builtin_popcount
#define btclz __builtin_clz

#define sz(x) (int)(x.size());
#define all(x) x.begin(), x.end()
#define debug(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int d4x[4] = {1, 0, -1, 0}; int d4y[4] = {0, 1, 0, -1};
int d8x[8] = {0, 1, 1, 1, 0, -1, -1, -1};
int d8y[8] = {1, 1, 0, -1, -1, -1, 0, 1};

template<class X, class Y>
    bool minimize(X &x, const Y &y) {
        if (x > y)
        {
            x = y;
            return true;
        }
        return false;
    }
template<class X, class Y>
    bool maximize(X &x, const Y &y) {
        if (x < y)
        {
            x = y;
            return true;
        }
        return false;
    }

const int MOD = 1e9 + 7; //998244353

template<class X, class Y>
    void add(X &x, const Y &y) {
        x = (x + y);
        if(x >= MOD) x -= MOD;
    }

template<class X, class Y>
    void sub(X &x, const Y &y) {
        x = (x - y);
        if(x < 0) x += MOD;
    }

/* Author : Le Ngoc Bao Anh, 12A5, LQD High School for Gifted Student*/

const ll INF = 1e9;
const int N = 1e5 + 10;
const int S = 330;

int a[N], best[N], cnt[N], ans[N];
bool c[N];
int f[S][N];

void solve() {
    int n, k; cin >> n >> k;

    int num = 330;
    int block = (n + num - 1) / num;
    for(int i = 0; i < n; i++) cin >> a[i];

    a[n] = -INF;
    for(int i = 1; i <= block; i++) {
        int l = (i - 1) * num, r = min(l + num - 1, n - 1);
        for(int j = 0; j < k; j++) f[i][j] = n;
        for(int j = l; j <= r; j++) {
            if(a[f[i][j % k]] < a[j]) f[i][j % k] = j;
        }

        best[i] = f[i][0];
    }

    for(int rep = 1; rep <= n; rep++) {
        int pos = 1;
        for(int i = 1; i <= block; i++) {
            if(a[best[i]] > a[best[pos]]) pos = i;
        }

        ans[rep] = a[best[pos]];
        for(int i = pos + 1; i <= block; i++) {
            ++cnt[i]; cnt[i] %= k;
            best[i] = f[i][cnt[i]];
        }

        int l = (pos - 1) * num, r = min(l + num - 1, n - 1);
        int d = 0;
        for(int i = l; i <= r; i++) {
            if(!c[i]) {
                f[pos][(i - d) % k] = n;
            } else ++d;
        }
        d = 0;
        c[best[pos]] = true;
        for(int i = l; i <= r; i++) {
            if(!c[i]) {
                if(a[f[pos][(i - d) % k]] < a[i]) f[pos][(i - d) % k] = i;
            } else ++d;
        }
        best[pos] = f[pos][cnt[pos]];
    }

    for(int i = 1; i <= n; i++) cout << ans[i] << " ";
}

int main()
{
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    #ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #else
    //online
    #endif

    int tc = 1, ddd = 0;
    // cin >> tc;
    while(tc--) {
        //ddd++;
        //cout << "Case #" << ddd << ": ";
        solve();
    }
}