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

long long INF = 1000000000000000000;

int main() {
    int K;
    long long N;
    cin >> K >> N;
    vector<long long>A(K),B(K);
    for(int i = 0; i < K; i++) {
        cin >> A[i];
        if(i == N) {
            cout << A[i] << endl;
            return 0;
        }
    }
    for(int i = 0; i < K; i++) {
        cin >> B[i];
    }
    for(int i = 0; i < 10*K; i++) {
        long long mx = -INF;
        for(int j = 0; j < K; j++) {
            mx = max(mx,min(A[A.size()-j-1],B[K-j-1]));
        }
        A.push_back(mx);
        if(K+i == N) {
            cout << mx << endl;
            return 0;
        }
    }
    N -= 10*K;
    cout << A[10*K+N%K] << endl;
}