#include<iostream> #include<deque> using namespace std; const int N = 1e6 + 10; int n, k, a[N]; deque<int> dq; int main(){ cin >> n >> k; for(int i = 0; i < n; i++){ cin >> a[i]; } for(int i = 0; i < n; i++){ while(!dq.empty() && a[dq.back()] <= a[i]) dq.pop_back(); dq.push_back(i); if(i - dq.front() >= k) dq.pop_front(); if(i+1 >= k) cout << a[dq.front()]; } return 0; }