#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 104857601;


const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename SemiGroup, typename F >
struct SlidingWindowAggregation {

  struct Node {
    SemiGroup val, sum;

    Node(const SemiGroup &val, const SemiGroup &sum) : val(val), sum(sum) {}
  };

  SlidingWindowAggregation(F f) : f(f) {}


  const F f;
  stack< Node > front, back;

  bool empty() const {
    return front.empty() && back.empty();
  }

  size_t size() const {
    return front.size() + back.size();
  }

  SemiGroup fold_all() const {
    if(front.empty()) {
      return back.top().sum;
    } else if(back.empty()) {
      return front.top().sum;
    } else {
      return f(front.top().sum, back.top().sum);
    }
  }

  void push(const SemiGroup &x) {
    if(back.empty()) {
      back.emplace(x, x);
    } else {
      back.emplace(x, f(back.top().sum, x));
    }
  }

  void pop() {
    if(front.empty()) {
      front.emplace(back.top().val, back.top().val);
      back.pop();
      while(!back.empty()) {
        front.emplace(back.top().val, f(back.top().val, front.top().sum));
        back.pop();
      }
    }
    front.pop();
  }
};


template< typename T, typename F >
SlidingWindowAggregation< T, F > get_sliding_window_aggregation(F f) {
  return SlidingWindowAggregation< T, F >(f);
}


int main() {
  int N, L;
  cin >> N >> L;
  vector< int > A(N);
  cin >> A;

  auto f = [](int a, int b) { return min(a, b); };
  auto SWAG = get_sliding_window_aggregation< int >(f);
  for(int i = 0; i < L - 1; i++) SWAG.push(A[i]);
  vector< int > ans;
  for(int i = L - 1; i < N; i++) {
    SWAG.push(A[i]);
    ans.emplace_back(SWAG.fold_all());
    SWAG.pop();
  }
  cout << ans << endl;
}


Measured memory_bytes: 11752