#include <bits/stdc++.h>
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define ll long long
#define pii pair<int, int>
#define inf 0x3f3f3f3f
#define fi first
#define pll pair<ll, ll>
#define se second
#define lll __int128
#define ld long double
#define all(a) a.begin() + 1, a.end()
#define iofast                   \
    ios::sync_with_stdio(false); \
    cin.tie(0), cout.tie(0)
#define lowbit(i) (i & (-i))
using namespace std;
const int maxn = 1e6 + 5, mod = 1000000007;
void solve()
{
    int n, k;
    cin >> n >> k;
    vector<int> a(n);
    for (auto &i : a)
        cin >> i;
    vector<int> tong;
    for (int i = 0; i < n; i += k)
    {
        tong.push_back(i - 1);
    }
    vector<bool> vis(n);
    vector<int> b(n + 1);
    for (int i = 0; i < k; i++)
    {
        vector<int> stk;
        for (auto j : tong)
        {
            while (j + 1 < n && stk.size() && a[stk.back()] < a[j + 1])
            {
                b[stk.back()]++;
                b[j + 1]--;
                stk.pop_back();
            }
            if (j + 1 < n)
                stk.push_back(j + 1);
        }
        tong.swap(stk);
    }

    for (int i = 0; i < n; i++)
    {
        if (i)
            b[i] += b[i - 1];
        if (!b[i])
        {
            cout << a[i] << " ";
        }
    }
    cout << "\n";
}
int main()
{
    iofast;
    int t = 1;
    // cin >> t;
    while (t--)
        solve();
    // cout << endl;
    //  system("pause");
}