You are given a sequence of integers of length nn and integer number kk . You should print any integer number xx in the range of [1;109][1;109] (i.e. 1≤x≤1091≤x≤109 ) such that exactly kk elements of given sequence are less than or equal to xx .
Note that the sequence can contain equal elements.
If there is no such xx , print "-1" (without quotes).
Input
The first line of the input contains integer numbers nn and kk (1≤n≤2⋅1051≤n≤2⋅105 , 0≤k≤n0≤k≤n ). The second line of the input contains nn integer numbers a1,a2,…,ana1,a2,…,an (1≤ai≤1091≤ai≤109 ) — the sequence itself.
Output
Print any integer number xx from range [1;109][1;109] such that exactly kk elements of given sequence is less or equal to xx .
If there is no such xx , print "-1" (without quotes).
Examples
Input
7 4 3 7 5 1 10 3 20
Output
6
Input
7 2 3 7 5 1 10 3 20
Output
-1
Note
In the first example 55 is also a valid answer because the elements with indices [1,3,4,6][1,3,4,6] is less than or equal to 55 and obviously less than or equal to 66 .
In the second example you cannot choose any number that only 22 elements of the given sequence will be less than or equal to this number because 33 elements of the given sequence will be also less than or equal to this number.
#include<stdio.h>
#include<algorithm>
#include<string.h>
#include<math.h>
#include<iostream>
using namespace std;
int main()
{
long long x,n,k,a[200000];
scanf("%lld%lld",&n,&k);
long long i;
for(i=0;i<n;i++)
{
scanf("%lld",&a[i]);
}
sort(a,a+n);
if(k==0) ///之前没有考虑K为0的情况。
{
long long b=a[0]-1>=1?a[0]-1:-1; ///因为X要为正整数。
printf("%lld\n",b);
}
else
{
if(a[k-1]==a[k])
{
printf("-1\n");
}
else
{
long long t=a[k-1];
printf("%lld\n",t);
}
}
}