#include <bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 1e17;
const long long mod = 1e9 + 7;
long long modInverse(long long a, long long m) {
  long long m0 = m;
  long long y = 0, x = 1;
  if (m == 1) return 0;
  while (a > 1) {
    long long q = a / m;
    long long t = m;
    m = a % m, a = t;
    t = y;
    y = x - q * y;
    x = t;
  }
  if (x < 0) x += m0;
  return x;
}
long long powm(long long a, long long b) {
  a = a % mod;
  long long res = 1;
  while (b) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b >>= 1;
  }
  return (res % mod);
}
const int N = 2e5 + 5;
int arr[N], n, k;
bool find(int val) {
  int cnt = 0, cnt2 = 0;
  for (int i = 0; i < (k % 2 ? n : n - 1); i++)
    if (arr[i] <= val) {
      cnt++;
      i++;
    }
  if (cnt >= (k + 1) / 2) return true;
  cnt = 0;
  for (int i = 1; i < (k % 2 ? n - 1 : n); i++)
    if (arr[i] <= val) {
      cnt++;
      i++;
    }
  if (cnt >= k / 2) return true;
  return false;
}
void solve() {
  cin >> n >> k;
  for (int i = 0; i < n; i++) cin >> arr[i];
  int l = 1, r = 1e9;
  while (l < r) {
    int mid = (l + r) / 2;
    if (find(mid))
      r = mid;
    else
      l = mid + 1;
  }
  cout << l << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  long long t = 1;
  for (long long i = 1; i <= t; i++) {
    solve();
  }
}
