#include<iostream>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
long N;
int K;
long A[1010],B[1010];
const int LIM=1<<17;
long T[LIM];
vector<long>succ(vector<long>F)
{
	long nxt=-9e18;
	for(int j=0;j<K;j++)nxt=max(nxt,min(F[j],B[j]));
	F.erase(F.begin());
	F.push_back(nxt);
	return F;
}
main()
{
	cin>>K>>N;
	for(int i=0;i<K;i++)cin>>A[i];
	for(int i=0;i<K;i++)cin>>B[i];
	for(int i=0;i<K;i++)T[i]=A[i];
	if(N<K)
	{
		cout<<A[N]<<endl;
		return 0;
	}
	vector<long>F(A,A+K);
	long U=N-K;
	map<vector<long>,int>mp;
	int now=K;
	mp[F]=now;
	while(U>0&&now<LIM)
	{
		U--;
		F=succ(F);
		T[now]=F[K-1];
		now++;
		if(mp.find(F)!=mp.end())U%=now-mp[F];
		else mp[F]=now;
	}
	if(U==0)cout<<succ(F)[K-1]<<endl;
	else
	{
		if(N>=LIM)
		{
			N-=LIM;
			N%=K;
			N+=LIM-K;
		}
		cout<<T[N]<<endl;
	}
}