#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 1000000007;
// constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int X = 50000;
  int k; ll n; cin >> k >> n;
  vector<ll> a(X, -LINF), b(k);
  REP(i, k) cin >> a[i];
  REP(i, k) cin >> b[i];
  FOR(i, k, X) REP(j, k) chmax(a[i], min(a[i - k + j], b[j]));
  if (n < X) {
    cout << a[n] << '\n';
  } else {
    int period = k * 2;
    while (period > 0) {
      bool same = true;
      REP(i, period) {
        if (a[X - period + i] != a[X - period * 2 + i]) {
          same = false;
          break;
        }
      }
      if (same) break;
      --period;
    }
    assert(period > 0);
    n -= (n - X - 1 + period - 1) / period * period;
    cout << a[n] << '\n';
  }
  return 0;
}