#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint998244353;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf32 1000000000
#define Inf64 1000000000000000001LL

int main(){
	
	int n;
	long long x;
	cin>>n>>x;
	
	deque<long long> a(n);
	rep(i,n)cin>>a[i];
	if(x<=n)cout<<a[x-1]<<endl;
	else{
		vector<long long> cnt(n+5);
		rep(i,n){
			if(a[i] < cnt.size())cnt[a[i]]++;
		}
		set<long long> noone;
		rep(i,cnt.size()){
			if(cnt[i]==0)noone.insert(i);
		}
		x -= n;
		rep(i,n*2+5){
			
			a.push_back(*noone.begin());
			cnt[a.back()]++;
			noone.erase(noone.begin());
			x--;
			if(x==0){
				cout<<a.back()<<endl;
				return 0;
			}
			if(a[0]<cnt.size()){
				cnt[a[0]]--;
				if(cnt[a[0]]==0)noone.insert(a[0]);
			}
			if(i!=n*2+4)a.pop_front();
		}
		x--;
		cout<<a[x%(n+1)]<<endl;
	}
	
	return 0;
}