#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
vector<ll> swm1D(vector<ll> arr, long window_size){
    deque<long long> q;
    vector<ll> minimumresult;
    for(long i=0;i<window_size;i++){
        minimumresult.push_back(0);
        while(!q.empty() && arr[i] >= arr[q.back()]){
            q.pop_back();
        }
        q.push_back(i);
    }
    minimumresult[window_size-1] = arr[q.front()];
    for(long i=0;i<window_size;i++){
        minimumresult[i] = minimumresult[window_size-1];
    }
    for(long i=window_size;i<arr.size();i++){
        while(!q.empty() && arr[i] >= arr[q.back()])
            q.pop_back();
        while(!q.empty() && q.front() <= i-window_size)
            q.pop_front();
        q.push_back(i);
        minimumresult.push_back(arr[q.front()]);
    }
    return minimumresult;
}

int main() {
    int n,k;
    cin>>n>>k;
    vector<long long> arr(n);
    for(int i=0;i<n;i++)
        cin>>arr[i];
    vector<int> left(n), right(n);
    if(arr.size()<=2*k+1)
        cout<<*min_element(arr.begin(),arr.end());
    /* Enter your code here. Read input from STDIN. Print output to STDOUT */   
    return 0;
}