#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}
//a_n=c_0*a_0+c_1*a_1+...c_(n-1)*a_(n-1)
//a_ind?
//O(n^2 * log(k))
//ex.
//ll ans=kitama<ll,op1,op2>(p,q,K);
template<class T,T(*op1)(T,T),T(*op2)(T,T),T(*e)()>
T kitamasa(std::vector<T> c,std::vector<T> a,long long ind){
    int n=a.size();
    if(ind<n) return a[ind];
    std::vector<int> q;
    std::vector<T> x=c;
    while(ind!=n){
        if(ind%2||ind<=n*2+2) q.push_back(1),ind--;
        else q.push_back(0),ind/=2;
    }
    std::reverse(q.begin(),q.end());
    for(int que=0;que<q.size();que++){
        //cout<<que<<" "<<q[que]<<endl;
        if(q[que]){
            auto new_x=x;
            for(int j=0;j<n;j++){
                if(j!=0) new_x[j]=op1(x[j-1],op2(x[n-1],c[j]));
                else new_x[j]=op2(x[n-1],c[j]);
            }
            std::swap(new_x,x);
        }else{
            std::vector<std::vector<T>> new_x(n+1,std::vector<T>(n));
            new_x[0]=x;
            for(int k=0;k<n-1;k++){
                for(int j=0;j<n;j++){
                    if(j!=0) new_x[k+1][j]=op1(new_x[k][j-1],op2(new_x[k][n-1],c[j]));
                    else new_x[k+1][j]=op2(new_x[k][n-1],c[j]);
                }
            }
            for(int i=0;i<n;i++) for(int j=0;j<n;j++){
                new_x[n][i]=op1(new_x[n][i],op2(new_x[0][j],new_x[j][i]));
            }
            std::swap(x,new_x[n]);
        }
    }
    T ans=e();
    for(int i=0;i<n;i++){
        ans=op1(ans,op2(x[i],a[i]));
        //cout<<x[i]<<endl;
    }
    return ans;
}

using kita_F=long long;
long long kita_mod=1e9+7;
kita_F op1(kita_F x,kita_F y){
    return max(x,y);
}
kita_F op2(kita_F x,kita_F y){
    return min(x,y);
}
kita_F e(){
    return -ILL;
}

void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	ll K,N;
	cin>>K>>N;
	vector<ll> A(K),B(K);
	rep(i,K) cin>>A[i];
	rep(i,K) cin>>B[i];
	cout<<kitamasa<ll,op1,op2,e>(B,A,N)<<"\n";
}