#include <bits/stdc++.h>
using i64 = int64_t;
//#define int long long

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

  std::vector<std::pair<int, int>> a;
  for (int i = 1;i <= n; i ++) {
    int x;
    std::cin >> x;
    a.push_back({x, i});
  }
  sort(a.begin(), a.end(), [&](auto p, auto q) {
    if (p.first == q.first) {
      return p.second < q.second;
    }
    return p.first > q.first;
  });

  std::vector<int> ans;
  int cur = 0;
  for (auto [val, p] : a) {
    if (p < cur) continue;
    if ((p - cur - 1) % k == 0) {
      cur = p;
      ans.push_back(val);
    }
  }
  for (auto x : ans) std::cout << x << ' ';
}
signed main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t;
  t = 1;
  //std::cin >> t;

  while (t--) {
    solve();
  }

  return 0;
}