using System;
using System.Linq;
using System.Collections.Generic;

namespace Contest
{
    class Program
    {
        static void Main(string[] args)
        {
            ABC123.D();
        }

        class ABC123
        {
            public static void A()
            {
                var In = Enumerable.Range(0, 6).Select(i => Read.Int()).ToArray();
                Console.WriteLine(In[4] - In[0] <= In[5] ? "Yay!" : ":(");
            }
            public static void B()
            {
                Console.WriteLine(Enumerable.Range(0, 5).Select(i => Read.Int()).OrderBy(x => -((x - 1) % 10)).Select((x, i) => i < 4 ? (x + 9) / 10 * 10 : x).Sum());
            }
            public static void C()
            {
                var In = Enumerable.Range(0, 6).Select(i => Read.Long()).ToArray();
                var min = In.Skip(1).Min();
                Console.WriteLine((In[0] + min - 1) / min + 4);
            }
            public static void D()
            {
                var X = Read.Int();
                var Y = Read.Int();
                var Z = Read.Int();
                var K = Read.Int();
                var A = Read.LongN();
                var B = Read.LongN();
                var C = Read.LongN();

                var AB = new long[X * Y];
                for(int i = 0; i < X; ++i)
                {
                    for(int j = 0; j < Y; ++j)
                    {
                        AB[i * Y + j] = A[i] + B[j];
                    }
                }
                Array.Sort(AB, (x, y) => -x.CompareTo(y));
                int Nab = Math.Min(AB.Length, K);
                var ABC = new long[Nab * Z];
                for (int i = 0; i < Nab; ++i)
                {
                    for (int j = 0; j < Z; ++j)
                    {
                        ABC[i * Z + j] = (AB[i] + C[j]);
                    }
                }
                Array.Sort(ABC, (x, y) => -x.CompareTo(y));
                for (int i = 0; i < K; ++i)
                {
                    Console.WriteLine(ABC[i]);
                }
            }
        }
        class Util
        {
        }

        static class Read
        {
            static Queue<string> queue = new Queue<string>();
            static void Enqueue() { var ss = Console.ReadLine().Split(' '); foreach (var s in ss) { queue.Enqueue(s); } }
            public static int Int() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt32(queue.Dequeue()); }
            public static long Long() { if (queue.Count == 0) { Enqueue(); } return Convert.ToInt64(queue.Dequeue()); }
            public static string Str() { if (queue.Count == 0) { Enqueue(); } return queue.Dequeue(); }
            public static int[] IntN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt32(s)).ToArray(); }
            public static long[] LongN() { return Console.ReadLine().Split(' ').Select(s => Convert.ToInt64(s)).ToArray(); }
            public static string[] StrN() { return Console.ReadLine().Split(' '); }
            public static Tuple<int, int>[] TupleInt(int n) { List<Tuple<int, int>> list = new List<Tuple<int, int>>(); for (int i = 0; i < n; ++i) { var ab = Read.IntN(); list.Add(new Tuple<int, int>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<long, long>[] TupleLong(int n) { List<Tuple<long, long>> list = new List<Tuple<long, long>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<long, long>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<string, string>[] TupleStr(int n) { List<Tuple<string, string>> list = new List<Tuple<string, string>>(); for (int i = 0; i < n; ++i) { var ab = Read.StrN(); list.Add(new Tuple<string, string>(ab[0], ab[1])); } return list.ToArray(); }
            public static Tuple<double, double>[] TupleDouble(int n) { List<Tuple<double, double>> list = new List<Tuple<double, double>>(); for (int i = 0; i < n; ++i) { var ab = Read.LongN(); list.Add(new Tuple<double, double>(ab[0], ab[1])); } return list.ToArray(); }
            public static long[,] LongMatrix(int r, int c)
            {
                var mat = new long[r, c];
                for (int i = 0; i < r; ++i)
                {
                    var x = Read.LongN();
                    for (int j = 0; j < c; ++j)
                    {
                        mat[i, j] = x[j];
                    }
                }
                return mat;
            }
            public static Dictionary<int, HashSet<int>> AdjacencyList(int N, int M)
            {
                Dictionary<int, HashSet<int>> dict = new Dictionary<int, HashSet<int>>();
                for (int i = 0; i <= N; ++i)
                {
                    dict.Add(i, new HashSet<int>());
                }
                for (int i = 0; i < M; ++i)
                {
                    var ab = Read.IntN();
                    dict[ab[0]].Add(ab[1]);
                    dict[ab[1]].Add(ab[0]);
                }
                return dict;
            }
        }
    }
}


Measured memory_bytes: 45152