import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static string[] s_rd;
T RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }
T[] ARR(T = long)(in string str, T fix = 0) { auto r = str.split.to!(T[]); r[] += fix; return r; }
size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
bool minimize(T)(ref T x, T y) { if (x > y) { x = y; return true; } else { return false; } }
bool maximize(T)(ref T x, T y) { if (x < y) { x = y; return true; } else { return false; } }

long mod = 10^^9 + 7;
void moda(ref long x, long y) { x = (x + y) % mod; }
void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(ref long x, long y) { x = (x * y) % mod; }

void main()
{
	auto X = RD;
	auto Y = RD;
	auto Z = RD;
	auto K = RD;
	auto A = RDR.ARR;
	auto B = RDR.ARR;
	auto C = RDR.ARR;
	//A.sort!"a > b"();
	//B.sort!"a > b"();
	//C.sort!"a > b"();

	auto dp = new long[](X*Y);
	foreach (i; 0..X)
	{
		foreach (j; 0..Y)
		{
			dp[i*Y+j] = A[i] + B[j];
			//debug writeln(i, ":", j, " ", dp[i*Y+j]);
		}
	}
	dp.sort!"a > b"();
	
	/*auto dpd = new long[](X*Y-1);
	foreach (i; 0..X*Y-1)
	{
		dpd[i] = dp[i] - dp[i+1];
	}
	auto cd = new long[](Z-1);
	foreach (i; 0..Z-1)
	{
		cd[i] = C[i] - C[i+1];
	}*/

	auto dp2 = new long[](min(K, X*Y)*Z+1);
	foreach (i; 0..min(K, X*Y))
	{
		foreach (j; 0..Z)
		{
			dp2[i*Z+j] = dp[i] + C[j];
			//debug writeln(i, ":", j, " ", dp2[i*Z+j]);
		}
	}
	dp2.sort!"a > b"();
	
	foreach (e; dp2[0..K])
		writeln(e);
	stdout.flush();
	debug readln();
}