#include<bits/stdc++.h>
using namespace std;

#include<atcoder/all>
using namespace atcoder;
using mint=atcoder::modint998244353;

#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define rep(i,n) for(int i=0;i<(n);i++)
#define rng(i,l,r) for(int i=(l);i<(r);i++)
#define aint(x) (x).begin(),(x).end()

#define int long long
#define fi first
#define se second

struct fast_io{fast_io(){cin.tie(nullptr)->sync_with_stdio(false);}}_;

int op(int a,int b){return min(a,b);}
int e(){return 1e18;}

signed main(){
	int N,X;cin>>N>>X;
	
	vector<int> A(N);for(auto&&e:A)cin>>e;

	segtree<int,op,e> seg(vector<int>(N,0));

	for(int i=0;i<N;i++){
		if(A[i]<N)seg.set(A[i],seg.get(A[i])+1);
	}

	for(int i=0;i<3*N;i++){
		int idx=seg.max_right(0,[&](int x){return 0<x;});
		A.push_back(idx);
		if(idx<N)seg.set(idx,seg.get(idx)+1);
		int v=A[A.size()-N-1];
		if(v<N)seg.set(v,seg.get(v)-1);
	}

	X--;

	if(X<N){
		cout<<A[X]<<endl;
	}else{
		cout<<A[N+((X-N)%(N+1))]<<endl;
	}
}