Ashish has an array a of size n.

A subsequence of a is defined as a sequence that can be obtained from a by deleting some elements (possibly none), without changing the order of the remaining elements.

Consider a subsequence s of a. He defines the cost of s as the minimum between: 

  * The maximum among all elements at odd indices of s. 
  * The maximum among all elements at even indices of s. 



Note that the index of an element is its index in s, rather than its index in a. The positions are numbered from 1. So, the cost of s is equal to min(max(s_1, s_3, s_5, …), max(s_2, s_4, s_6, …)).

For example, the cost of \{7, 5, 6\} is min( max(7, 6), max(5) ) = min(7, 5) = 5.

Help him find the minimum cost of a subsequence of size k.

Input

The first line contains two integers n and k (2 ≤ k ≤ n ≤ 2 ⋅ 10^5) — the size of the array a and the size of the subsequence.

The next line contains n integers a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) — the elements of the array a.

Output

Output a single integer — the minimum cost of a subsequence of size k.

Examples

Input


4 2
1 2 3 4


Output


1

Input


4 3
1 2 3 4


Output


2

Input


5 3
5 3 4 2 6


Output


2

Input


6 4
5 3 50 2 4 5


Output


3

Note

In the first test, consider the subsequence s = \{1, 3\}. Here the cost is equal to min(max(1), max(3)) = 1.

In the second test, consider the subsequence s = \{1, 2, 4\}. Here the cost is equal to min(max(1, 4), max(2)) = 2.

In the fourth test, consider the subsequence s = \{3, 50, 2, 4\}. Here the cost is equal to min(max(3, 2), max(50, 4)) = 3.
import java.io.*;
import java.util.*;

public class CfA {

    static class Reader {
        BufferedReader br;
        StringTokenizer st;

        public Reader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static long binpow(int a, int b) {
        if (b == 0)
            return 1;
        long res = binpow(a, b / 2);
        if (b % 2 == 1)
            return res * res * a;
        else
            return res * res;
    }

    static long gcd(long a, long b) {
        if (b == 0)
            return a;
        return gcd(b, a % b);
    }

    static int n, m, x, y, k;
    static long ans;
    static final int MAX_K = 10000000;
    static int[] a;
    static List<Integer> freq;
    static int count2;

    static boolean even(int x) {
        List<Integer> list = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            if (list.size() % 2 == 0) {
                if (a[i] <= x)
                    list.add(a[i]);
            } else {
                list.add(a[i]);
            }
        }

        return list.size() >= k;
    }

    static boolean odd(int x) {
        List<Integer> list = new ArrayList<>();

        for (int i = 0; i < n; i++) {
            if (list.size() % 2 != 0) {
                if (a[i] <= x)
                    list.add(a[i]);
            } else {
                list.add(a[i]);
            }
        }

        return list.size() >= k;
    }

    public static void main(String[] args) throws Exception {
        Reader in = new Reader();
        n = in.nextInt();
        k = in.nextInt();
        a = new int[n];

        for(int i = 0;i < n;i++) a[i] = in.nextInt();

        int low = 1,high = 1000000000,mid;

        while(low < high)
        {
            mid = (low+high)/2;

            if(even(mid) || odd(mid))
                high = mid;
            else 
            low = mid + 1;    

        }

        System.out.println(high);

    }

}

// 76 52 28 00 73 42 23 64 48