#include int ri() { int n; scanf("%d", &n); return n; } int main() { int k = ri(); int64_t n; std::cin >> n; std::vector a(k); int64_t b[k]; for (auto &i : a) std::cin >> i; for (auto &i : b) std::cin >> i; for (int i = 0; i < 10; i++) { for (int j = 0; j < k; j++) { int index = i * k + j; int64_t next = -1000000000000000001; for (int l = 0; l < k; l++) next = std::max(next, std::min(b[l], a[index + l])); a.push_back(next); } } if (n < (int) a.size()) { printf("%" PRId64 "\n", a[n]); return 0; } else { for (int i = 1; i <= k; i++) { bool ok = true; for (int j = a.size() - i - i; j < (int) a.size() - i; j++) if (a[j] != a[j + i]) { ok = false; break; } if (ok) { int left = (n - (a.size() - i)) % i; printf("%" PRId64 "\n", a[a.size() - i + left]); return 0; } } } return 0; }