C - Maximum of Maximums of Minimums

You are given an array a₁, a₂, ..., a_n consisting of n integers, and an integer k. You have to split the array into exactly k non-empty subsegments. You'll then compute the minimum integer on each subsegment, and take the maximum integer over the k obtained minimums. What is the maximum possible integer you can get?

Definitions of subsegment and array splitting are given in notes.

Input

The first line contains two integers n and k (1 ≤ k ≤ n ≤  10⁵) — the size of the array a and the number of subsegments you have to split the array to.

The second line contains n integers a₁,  a₂,  ...,  a_n ( - 10⁹  ≤  a_i ≤  10⁹).

Output

Print single integer — the maximum possible integer you can get if you split the array into k non-empty subsegments and take maximum of minimums on the subsegments.

Example

Input

5 2
1 2 3 4 5

Output

5

Input

5 1
-4 -5 -3 -2 -1

Output

-5

Note

A subsegment [l,  r] (l ≤ r) of array a is the sequence a_l,  a_l + 1,  ...,  a_r.

Splitting of array a of n elements into k subsegments [l₁, r₁], [l₂, r₂], ..., [l_k, r_k] (l₁ = 1, r_k = n, l_i = r_i - 1 + 1 for all i > 1) is k sequences (a_l1, ..., a_r1), ..., (a_lk, ..., a_rk).

In the first example you should split the array into subsegments [1, 4] and [5, 5] that results in sequences (1, 2, 3, 4) and (5). The minimums are min(1, 2, 3, 4) = 1 and min(5) = 5. The resulting maximum is max(1, 5) = 5. It is obvious that you can't reach greater result.

In the second example the only option you have is to split the array into one subsegment [1, 5], that results in one sequence ( - 4,  - 5,  - 3,  - 2,  - 1). The only minimum is min( - 4,  - 5,  - 3,  - 2,  - 1) =  - 5. The resulting maximum is  - 5.

题意：给你一个由n个数组成的序列，要求分成k段子序列，求每段子序列组成的最小值中的最大值；

思路：分类讨论一下k，如果k=1的话，那么肯定就是在整个序列中的最小值，k>2的话，我们直接把最大值独立出来形成一个单独的子序列，所以唯一讨论的就是k=2时如何找出最大值，假如说有这样一个序列：

a,b,c,d,e,f  ，因为是分成两段，所以肯定是从第一位开始形成一段，最后一位形成一段，所以a肯定是大于等于第一段的最小值，f大于等于第二段的最小值，所以我们只要比较一下序列两端的值，谁大就把他单独作为一个序列输出即可。。。（注意中间的数是不可能单独作为一个子序列的（k==2））

下面附上我的代码：

#include<bits/stdc++.h>
using namespace std;
int a[100005],b[100005];
int main()
{
	int n,k;
	while(cin>>n>>k)
	{
		memset(a,0,sizeof(a));
		memset(b,0,sizeof(b));
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a[i]);
			b[i]=a[i];
		}
		sort(b,b+n);
		if(k==1)
			printf("%d\n",b[0]);
		else if(k==2)
		{
			int p=max(a[0],a[n-1]);
			printf("%d\n",p);
		}
		else
			printf("%d\n",b[n-1]);
	}	
	return 0;
}