The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles, respectively. Each cake has an integer value called deliciousness, as follows:

* The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.
* The deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.
* The deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.



Takahashi decides to buy three cakes, one for each of the three shapes of the candles, to celebrate ABC 123.
There are X \times Y \times Z such ways to choose three cakes.
We will arrange these X \times Y \times Z ways in descending order of the sum of the deliciousness of the cakes.
Print the sums of the deliciousness of the cakes for the first, second, ..., K-th ways in this list.

Constraints

* 1 \leq X \leq 1 \ 000
* 1 \leq Y \leq 1 \ 000
* 1 \leq Z \leq 1 \ 000
* 1 \leq K \leq \min(3 \ 000, X \times Y \times Z)
* 1 \leq A_i \leq 10 \ 000 \ 000 \ 000
* 1 \leq B_i \leq 10 \ 000 \ 000 \ 000
* 1 \leq C_i \leq 10 \ 000 \ 000 \ 000
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


X Y Z K
A_1 \ A_2 \ A_3 \ ... \ A_X
B_1 \ B_2 \ B_3 \ ... \ B_Y
C_1 \ C_2 \ C_3 \ ... \ C_Z


Output

Print K lines. The i-th line should contain the i-th value stated in the problem statement.

Examples

Input

2 2 2 8
4 6
1 5
3 8


Output

19
17
15
14
13
12
10
8


Input

3 3 3 5
1 10 100
2 20 200
1 10 100


Output

400
310
310
301
301


Input

10 10 10 20
7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488
1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338
4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736


Output

23379871545
22444657051
22302177772
22095691512
21667941469
21366963278
21287912315
21279176669
21160477018
21085311041
21059876163
21017997739
20703329561
20702387965
20590247696
20383761436
20343962175
20254073196
20210218542
20150096547

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Comparator;
import java.util.InputMismatchException;
import java.util.NoSuchElementException;
import java.util.Objects;
import java.util.PriorityQueue;
import java.util.TreeSet;

public class Main implements Runnable { // クラス名はMain1

	static int mod = 1000000000 + 7; //10^9+7
	int[] dx = { 1, 0, -1, 0 }, dy = { 0, 1, 0, -1 }; //4 directions

	public static void main(String[] args) {
		Thread.setDefaultUncaughtExceptionHandler((t, e) -> System.exit(1));
		new Thread(null, new Main(), "", 1024 * 1024 * 1024).start(); // 16MBスタックを確保して実行
	}

	public void run() {
		PrintWriter out = new PrintWriter(System.out);
		InputReader sc = new InputReader(System.in);

		try {
			/**
			 * Bit 全探索
				//Nは要素数 (bit全探索)
				//計算量はO(2^N) Nが0-20~25 (30は多分無理)くらいまでしか使えない
				Out: for (int bit = 0; bit < (1 << N); bit++) {
					System.out.println(Integer.toBinaryString(bit));
					In: for (int j = 0; j < N; j++) {
						System.out.println(1 & (bit >> j));
						//1が立ってれば対象。例えば101だったら1桁目と3桁目は選ばれている
						//「二進数iをjだけ右にビットシフトしたときの、iの1桁目と1とでビット論理積をとって、演算結果が1であるなら処理を実行する」
						if ((1 & bit >> j) == 1) {
						}
					}
				}
			 *
			 * 表示系
			 *   System.out.println();
			 *   System.out.println("i:" + i + " ,j:" + j);
			 *   System.out.println(Arrays.toString(A));
			 *
			 * Sort (Arrays)
			 *  Integer[] A = new Integer[N];
			 *    Desc : Arrays.sort(A , Collections.reverseOrder());
			 *    Asc  : Arrays.sort(A);
			 *
			 * 定義系
			 *   int[] s = new int[M];
			 *   ArrayDeque<Integer> deq= new ArrayDeque<>();//先頭と末尾への要素の追加・先頭と末尾の要素の取り出しと削除が定数時間
			 *   ArrayList<Integer> arr = new ArrayList<Integer>();//定数時間
			 *   HashMap<Integer,Integer> hm = new HashMap<>(); //定数時間
			 *
			 *   //要素の追加と、最小の要素の取り出しと削除が対数時間
			 *   PriorityQueue<Integer> pq = new PriorityQueue<>();//昇順
			 *   PriorityQueue<Integer> pq = new PriorityQueue<>(Collections.reverseOrder()); //逆順。降順
			 *
			 *   TreeSet<Integer> ts = new TreeSet<>();//対数時間(重複はできない)
			 *
			 * 文字系
			 *   String S = sc.next().trim();
			 *   for (char i = 'a'; i <= 'z'; i++) {}
			 *   S.substring(1,2);//あいうえお → い
			 *   S.substring(0,1); // 1文字目をとりたいとき
			 *   文字列のSort
			 *    String sorted = S.chars().sorted().collect(StringBuilder::new,StringBuilder::appendCodePoint, StringBuilder::append) .toString();
			 */

			int X = sc.nextInt();
			int Y = sc.nextInt();
			int Z = sc.nextInt();
			long K = sc.nextLong();

			Long[] a = new Long[X];
			Long[] b = new Long[Y];
			Long[] c = new Long[Z];

			for (int i = 0; i < X; i++) {
				a[i] = sc.nextLong();
			}
			for (int i = 0; i < Y; i++) {
				b[i] = sc.nextLong();
			}
			for (int i = 0; i < Z; i++) {
				c[i] = sc.nextLong();
			}

			Arrays.sort(a, Comparator.reverseOrder());
			Arrays.sort(b, Comparator.reverseOrder());
			Arrays.sort(c, Comparator.reverseOrder());

			PriorityQueue<Total> pq = new PriorityQueue<>(new TotalComp());//TotalのClassで降順にしている
			TreeSet<Long> ts = new TreeSet<>();

			Total t1 = new Total(a[0] + b[0] + c[0], 0, 0, 0);
			pq.add(t1);

			int count = 1;
			while (pq.size() > 0 && count <= K) {
				Total t = pq.poll();
				out.println(t.total);

				if ((t.x + 1) < X) {
					//if (!used[t.x + 1][t.y][t.z]) {
					long next = (t.x + 1) * 10000 * 10000 + 10000 * t.y + t.z;
					if (!ts.contains(next)) {
						ts.add(next);
						Total tx = new Total(a[t.x + 1] + b[t.y] + c[t.z], t.x + 1, t.y, t.z);
						pq.offer(tx);
					}

				}

				if ((t.y + 1) < Y) {
					long next = (t.x) * 10000 * 10000 + 10000 * (t.y + 1) + t.z;
					if (!ts.contains(next)) {
						ts.add(next);
						Total ty = new Total(a[t.x] + b[t.y + 1] + c[t.z], t.x, t.y + 1, t.z);
						pq.offer(ty);
					}
				}

				if ((t.z + 1) < Z) {
					long next = t.x * 10000 * 10000 + 10000 * t.y + (t.z + 1);
					if (!ts.contains(next)) {
						ts.add(next);
						Total tz = new Total(a[t.x] + b[t.y] + c[t.z + 1], t.x, t.y, t.z + 1);
						pq.offer(tz);
					}
				}
				count++;
			}

			//Flushしてからcloseするのが無難
			out.flush();
			out.close();

		} catch (

		ArithmeticException ae) {
			ae.printStackTrace();
			throw new RuntimeException();
		} catch (Exception e) {
			e.printStackTrace();
			throw new RuntimeException();
		}

	}

	static class TotalComp implements Comparator<Total> {
		@Override
		public int compare(Total p1, Total p2) {
			return (-1) * p1.total.compareTo(p2.total);
		}
	}

	static class Total {

		public Long total;
		public int x;
		public int y;
		public int z;

		public Total(Long total, int x, int y, int z) {
			this.total = total;
			this.x = x;
			this.y = y;
			this.z = z;
		}

		@Override
		public boolean equals(Object obj) {
			if (obj instanceof Total) {
				Total other = (Total) obj;
				//変数ageと変数nameが等しければtrueを返す。(同じ値を持っているとみなす)
				return other.x == this.x && other.y == this.y && other.z == this.z && other.total.equals(this.total);
			}
			return false;
		}

		@Override
		public int hashCode() {
			return Objects.hash(this.total, this.x, this.y, this.z);
		}
	}

	// 高速なScanner
	static class InputReader {
		private InputStream in;
		private byte[] buffer = new byte[1024];
		private int curbuf;
		private int lenbuf;

		public InputReader(InputStream in) {
			this.in = in;
			this.curbuf = this.lenbuf = 0;
		}

		public boolean hasNextByte() {
			if (curbuf >= 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 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;
		}
	}
}
