def main():
    import sys
    input = sys.stdin.read().split()
    idx = 0
    K = int(input[idx])
    idx += 1
    N = int(input[idx])
    idx += 1
    A = list(map(int, input[idx:idx+K]))
    idx += K
    B = list(map(int, input[idx:idx+K]))
    idx += K

    if N < K:
        print(A[N])
        return

    max_initial = max(A)
    max_B = max(B)
    max_possible = min(max_initial, max_B)

    window = A.copy()
    for i in range(K, N + 1):
        current_max = -float('inf')
        for j in range(K):
            a = window[j]
            b = B[j]
            current_min = min(a, b)
            if current_min > current_max:
                current_max = current_min
        if current_max == max_possible:
            if all(x == max_possible for x in window):
                print(max_possible)
                return
        window.pop(0)
        window.append(current_max)
        if i >= N:
            print(window[-1])
            return

    print(window[-1])

if __name__ == "__main__":
    main()