using System;
using System.Collections.Generic;
using System.IO;
using System.Linq;
using System.Runtime.InteropServices;
using System.Text;

namespace Contest
{
    struct S
    {
        public int A, B, C;
        public long Sum;

        public S(int a, int b, int c, long s)
        {
            A = a;
            B = b;
            C = c;
            Sum = s;
        }
    }

    class Program
    {
        public void Solve()
        {
            var sc = new Scanner();
            int X = sc.NextInt();
            int Y = sc.NextInt();
            int Z = sc.NextInt();
            int K = sc.NextInt();
            long[] A = sc.LongArray();
            long[] B = sc.LongArray();
            long[] C = sc.LongArray();

            var sb = new StringBuilder();

            var pq = new PriorityQueue<S>((a, b) => -a.Sum.CompareTo(b.Sum));

            int cnt = 0;
            var hs = new HashSet<S>();

            Array.Sort(A, (a, b) => -a.CompareTo(b));
            Array.Sort(B, (a, b) => -a.CompareTo(b));
            Array.Sort(C, (a, b) => -a.CompareTo(b));

            pq.Enqueue(new S(0, 0, 0, A[0] + B[0] + C[0]));

            while (cnt < K)
            {
                var s = pq.Dequeue();

                if (!hs.Add(s)) continue;

                sb.AppendLine(s.Sum.ToString());
                cnt++;
                if (s.A + 1 < A.Length)
                {
                    var next = new S(s.A + 1, s.B, s.C, A[s.A + 1] + B[s.B] + C[s.C]);
                    pq.Enqueue(next);
                }
                if (s.B + 1 < B.Length)
                {
                    var next = new S(s.A, s.B + 1, s.C, A[s.A] + B[s.B + 1] + C[s.C]);
                    pq.Enqueue(next);
                }
                if (s.C + 1 < C.Length)
                {
                    var next = new S(s.A, s.B, s.C + 1, A[s.A] + B[s.B] + C[s.C + 1]);
                    pq.Enqueue(next);
                }
            }
            Console.Write(sb.ToString());
        }


        static void Main(string[] args) => new Program().Solve();
    }

    class Scanner
    {
        private char _separator = ' ';
        private StreamReader _stream = new StreamReader(Console.OpenStandardInput());
        private int _pos = 0;
        private string[] _line = new string[0];
        public string Next()
        {
            if (_pos >= _line.Length)
            {
                _line = _stream.ReadLine().Split(_separator);
                _pos = 0;
            }
            return _line[_pos++];
        }
        public int NextInt() => int.Parse(Next());
        public long NextLong() => long.Parse(Next());
        public double NextDouble() => double.Parse(Next());
        public string[] Array()
        {
            if (_pos >= _line.Length)
                _line = _stream.ReadLine().Split(_separator);
            _pos = _line.Length;
            return _line;
        }
        public int[] IntArray()
        {
            var arr = Array();
            var res = new int[arr.Length];
            for (int i = 0; i < arr.Length; i++)
            {
                res[i] = int.Parse(arr[i]);
            }
            return res;
        }
        public long[] LongArray()
        {
            var arr = Array();
            var res = new long[arr.Length];
            for (int i = 0; i < arr.Length; i++)
            {
                res[i] = long.Parse(arr[i]);
            }
            return res;
        }
        public double[] DoubleArray()
        {
            var arr = Array();
            var res = new double[arr.Length];
            for (int i = 0; i < arr.Length; i++)
            {
                res[i] = double.Parse(arr[i]);
            }
            return res;
        }
    }


    class PriorityQueue<T>
    {
        private readonly List<T> heap;
        private readonly Comparison<T> compare;
        private int size;
        public PriorityQueue() : this(Comparer<T>.Default) { }
        public PriorityQueue(IComparer<T> comparer) : this(16, comparer.Compare) { }
        public PriorityQueue(Comparison<T> comparison) : this(16, comparison) { }
        public PriorityQueue(int capacity, Comparison<T> comparison)
        {
            this.heap = new List<T>(capacity);
            this.compare = comparison;
        }
        public void Enqueue(T item)
        {
            this.heap.Add(item);
            var i = size++;
            while (i > 0)
            {
                var p = (i - 1) >> 1;
                if (compare(this.heap[p], item) <= 0)
                    break;
                this.heap[i] = heap[p];
                i = p;
            }
            this.heap[i] = item;

        }
        public T Dequeue()
        {
            var ret = this.heap[0];
            var x = this.heap[--size];
            var i = 0;
            while ((i << 1) + 1 < size)
            {
                var a = (i << 1) + 1;
                var b = (i << 1) + 2;
                if (b < size && compare(heap[b], heap[a]) < 0) a = b;
                if (compare(heap[a], x) >= 0)
                    break;
                heap[i] = heap[a];
                i = a;
            }
            heap[i] = x;
            heap.RemoveAt(size);
            return ret;
        }
        public T Peek() { return heap[0]; }
        public int Count { get { return size; } }
        public bool Any() { return size > 0; }
    }
}


Measured memory_bytes: 18652