import java.io.IOException; import java.io.InputStream; import java.io.PrintWriter; import java.math.BigDecimal; import java.math.RoundingMode; import java.util.*; public class Main { static final long MOD=1000000007; static final long MOD1=998244353; static int size = 0; static long MAX = 1000000000000000000l; public static void main(String[] args){ PrintWriter out = new PrintWriter(System.out); InputReader sc=new InputReader(System.in); int k = sc.nextInt(); long n = sc.nextLong(); long[] init = sc.nextLongArray(k); long[] a = sc.nextLongArray(k); kitamasa KITA = new kitamasa(k, a); System.out.println(KITA.calc(init, n)); } //きたまさ法, k項間線形漸化式の第n項をO(k^2logn)で求める //注) aもinitも小さい順に入れていく、a_k = c_k-1*a_k-1 + .... + c_0*a_0 なら添え字の通りにいれる //0index-dで0~k-1項を初項として計算する //コンストラクタに漸化式の係数を与えて初期化。calcで初項を与えて計算する。 static class kitamasa{ int k; long[] a; public kitamasa(int k, long[] a) { this.k = k; this.a = new long[k]; for (int i = 0; i < a.length; i++) { this.a[i] = a[i]; } } long[] dfs(long n){ if(n == k) return a; long[] res = new long[k]; Arrays.fill(res, Long.MIN_VALUE); if((n & 1) == 1 || n < k * 2){ long[] x = dfs(n - 1); oneplus(res, x); } else{ long[][] x = new long[k][k]; for (int i = 0; i < x.length; i++) { Arrays.fill(x[i], Long.MIN_VALUE); } x[0] = dfs(n >> 1); for(int i = 0; i + 1 < k; i++){ oneplus(x[i+1], x[i]); } for(int i = 0; i < k; i++){ for(int j = 0; j < k; j++){ res[j] = Math.max(res[j], Math.min(x[0][i] , x[i][j])); } } } return res; } void oneplus(long[] res, long[] x) { for(int i = 0; i < k; i++) res[i] = Math.min(a[i] , x[k - 1]); for(int i = 0; i + 1 < k; i++) res[i + 1] = Math.max(res[i + 1] , x[i]); } long calc(long[] init, long n) { if(n= lenbuf) { curbuf = 0; try { lenbuf = in.read(buffer); } catch (IOException e) { throw new InputMismatchException(); } if (lenbuf <= 0) return false; } return true; } private int readByte() { if (hasNextByte()) return buffer[curbuf++]; else return -1; } private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); } private void skip() { while (hasNextByte() && isSpaceChar(buffer[curbuf])) curbuf++; } public boolean hasNext() { skip(); return hasNextByte(); } public String next() { if (!hasNext()) throw new NoSuchElementException(); StringBuilder sb = new StringBuilder(); int b = readByte(); while (!isSpaceChar(b)) { sb.appendCodePoint(b); b = readByte(); } return sb.toString(); } public int nextInt() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } int res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public long nextLong() { if (!hasNext()) throw new NoSuchElementException(); int c = readByte(); while (isSpaceChar(c)) c = readByte(); boolean minus = false; if (c == '-') { minus = true; c = readByte(); } long res = 0; do { if (c < '0' || c > '9') throw new InputMismatchException(); res = res * 10 + c - '0'; c = readByte(); } while (!isSpaceChar(c)); return (minus) ? -res : res; } public double nextDouble() { return Double.parseDouble(next()); } public int[] nextIntArray(int n) { int[] a = new int[n]; for (int i = 0; i < n; i++) a[i] = nextInt(); return a; } public double[] nextDoubleArray(int n) { double[] a = new double[n]; for (int i = 0; i < n; i++) a[i] = nextDouble(); return a; } public long[] nextLongArray(int n) { long[] a = new long[n]; for (int i = 0; i < n; i++) a[i] = nextLong(); return a; } public char[][] nextCharMap(int n, int m) { char[][] map = new char[n][m]; for (int i = 0; i < n; i++) map[i] = next().toCharArray(); return map; } } }