#if DEBUG
using Microsoft.VisualStudio.TestTools.UnitTesting;
#endif
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using System.Threading.Tasks;

namespace Contest
{
    class Program
    {
        public static IO.StreamScanner scanner = new IO.StreamScanner(Console.OpenStandardInput());

        static void Main(string[] args)
        {
            var x = scanner.Integer();
            var y = scanner.Integer();
            var z = scanner.Integer();
            var k = scanner.Integer();
            var a = scanner.ScanLine().Split().Select(v => long.Parse(v)).ToList();
            var b = scanner.ScanLine().Split().Select(v => long.Parse(v)).ToList();
            var c = scanner.ScanLine().Split().Select(v => long.Parse(v)).ToList();

            var ans = GetAns(k, x, y, z, a, b, c);
            foreach (var r in ans) IO.Printer.Out.WriteLine(r);

            IO.Printer.Out.Flush();
        }

        public static List<long> GetAns(int k, int x, int y, int z,
            List<long> a, List<long> b, List<long> c)
        {
            var ret = new List<long>();
            a = a.OrderByDescending(v => v).ToList();
            b = b.OrderByDescending(v => v).ToList();
            c = c.OrderByDescending(v => v).ToList();

            var que = new PriorityQueue<Node>();
            que.Push(new Node(a, b, c) { A_Idx = 0, B_Idx = 0, C_Idx = 0 });

            var used = new HashSet<Tuple<int, int, int>>();
            used.Add(new Tuple<int, int, int>(0, 0, 0));

            while (ret.Count() < k)
            {
                var cur = que.Pop();
                ret.Add(cur.Sum());

                if (cur.A_Idx < a.Count() - 1 && !used.Contains(new Tuple<int, int, int>(cur.A_Idx + 1, cur.B_Idx, cur.C_Idx)))
                {
                    used.Add(new Tuple<int, int, int>(cur.A_Idx + 1, cur.B_Idx, cur.C_Idx));
                    que.Push(new Node(a, b, c) { A_Idx = cur.A_Idx + 1, B_Idx = cur.B_Idx, C_Idx = cur.C_Idx });
                }
                if (cur.B_Idx < b.Count() - 1 && !used.Contains(new Tuple<int, int, int>(cur.A_Idx, cur.B_Idx + 1, cur.C_Idx)))
                {
                    used.Add(new Tuple<int, int, int>(cur.A_Idx, cur.B_Idx + 1, cur.C_Idx));
                    que.Push(new Node(a, b, c) { A_Idx = cur.A_Idx, B_Idx = cur.B_Idx + 1, C_Idx = cur.C_Idx });
                }
                if (cur.C_Idx < c.Count() - 1 && !used.Contains(new Tuple<int, int, int>(cur.A_Idx, cur.B_Idx, cur.C_Idx + 1)))
                {
                    used.Add(new Tuple<int, int, int>(cur.A_Idx, cur.B_Idx, cur.C_Idx + 1));
                    que.Push(new Node(a, b, c) { A_Idx = cur.A_Idx, B_Idx = cur.B_Idx, C_Idx = cur.C_Idx + 1 });
                }
            }

            return ret;
        }
    }

    public class Node : IComparable
    {
        public int A_Idx;
        public int B_Idx;
        public int C_Idx;

        List<long> _a;
        List<long> _b;
        List<long> _c;

        public Node(List<long> a, List<long> b, List<long> c)
        {
            _a = a;
            _b = b;
            _c = c;
        }

        public int CompareTo(object obj)
        {
            var other = obj as Node;
            return other.Sum().CompareTo(Sum());
        }

        public long Sum()
        {
            return _a[A_Idx] + _b[B_Idx] + _c[C_Idx];
        }
    }

    public class PriorityQueue<T> where T : IComparable
    {
        private IComparer<T> _comparer = null;
        private int _type = 0;

        private T[] _heap;
        private int _sz = 0;

        private int _count = 0;

        /// <summary>
        /// Priority Queue with custom comparer
        /// </summary>
        public PriorityQueue(IComparer<T> comparer)
        {
            _heap = new T[128];
            _comparer = comparer;
        }

        /// <summary>
        /// Priority queue
        /// </summary>
        /// <param name="type">0: asc, 1:desc</param>
        public PriorityQueue(int type = 0)
        {
            _heap = new T[128];
            _type = type;
        }

        private int Compare(T x, T y)
        {
            if (_comparer != null) return _comparer.Compare(x, y);
            return _type == 0 ? x.CompareTo(y) : y.CompareTo(x);
        }

        public void Push(T x)
        {
            _count++;
            if (_count > _heap.Length)
            {
                var newheap = new T[_heap.Length * 2];
                for (int n = 0; n < _heap.Length; n++) newheap[n] = _heap[n];
                _heap = newheap;
            }

            //node number
            var i = _sz++;

            while (i > 0)
            {
                //parent node number
                var p = (i - 1) / 2;

                if (Compare(_heap[p], x) <= 0) break;

                _heap[i] = _heap[p];
                i = p;
            }

            _heap[i] = x;
        }

        public T Pop()
        {
            _count--;

            T ret = _heap[0];
            T x = _heap[--_sz];

            int i = 0;
            while (i * 2 + 1 < _sz)
            {
                //children
                int a = i * 2 + 1;
                int b = i * 2 + 2;

                if (b < _sz && Compare(_heap[b], _heap[a]) < 0) a = b;

                if (Compare(_heap[a], x) >= 0) break;

                _heap[i] = _heap[a];
                i = a;
            }

            _heap[i] = x;

            return ret;
        }

        public int Count()
        {
            return _count;
        }

        public T Peek()
        {
            return _heap[0];
        }

        public bool Contains(T x)
        {
            for (int i = 0; i < _sz; i++) if (x.Equals(_heap[i])) return true;
            return false;
        }

        public void Clear()
        {
            while (this.Count() > 0) this.Pop();
        }

        public IEnumerator<T> GetEnumerator()
        {
            var ret = new List<T>();

            while (this.Count() > 0)
            {
                ret.Add(this.Pop());
            }

            foreach (var r in ret)
            {
                this.Push(r);
                yield return r;
            }
        }

        public T[] ToArray()
        {
            T[] array = new T[_sz];
            int i = 0;

            foreach (var r in this)
            {
                array[i++] = r;
            }

            return array;
        }
    }

#if DEBUG
    [TestClass]
    public class Test
    {
        [TestMethod]
        public void Test1()
        {
            var x = 2;
            var y = 2;
            var z = 2;
            var k = 8;
            var a = new List<long> { 4, 6 };
            var b = new List<long> { 1, 5 };
            var c = new List<long> { 3, 8 };
            var exp = new List<long>
            {
                19,
                17,
                15,
                14,
                13,
                12,
                10,
                8,
            };
            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }

        [TestMethod]
        public void Test2()
        {
            var x = 3;
            var y = 3;
            var z = 3;
            var k = 5;
            var a = new List<long> { 1, 10, 100 };
            var b = new List<long> { 2, 20, 200 };
            var c = new List<long> { 1, 10, 100 };
            var exp = new List<long>
            {
                400,
                310,
                310,
                301,
                301,
            };
            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }

        [TestMethod]
        public void Test_Rnd()
        {
            var rnd = new Random();
            var x = 28;
            var y = 34;
            var z = 25;
            var k = 31;
            var a = Enumerable.Range(0, x).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var b = Enumerable.Range(0, y).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var c = Enumerable.Range(0, z).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var exp = new List<long>();

            for (int i = 0; i < x; i++)
            {
                for (int j = 0; j < y; j++)
                {
                    for (int l = 0; l < z; l++)
                    {
                        exp.Add(a[i] + b[j] + c[l]);
                    }
                }
            }
            exp = exp.OrderByDescending(v => v).Take(k).ToList();

            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }

        [TestMethod]
        public void Test_Rnd2()
        {
            var rnd = new Random();
            var x = 31;
            var y = 15;
            var z = 21;
            var k = x * y * z;
            var a = Enumerable.Range(0, x).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var b = Enumerable.Range(0, y).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var c = Enumerable.Range(0, z).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var exp = new List<long>();

            for (int i = 0; i < x; i++)
            {
                for (int j = 0; j < y; j++)
                {
                    for (int l = 0; l < z; l++)
                    {
                        exp.Add(a[i] + b[j] + c[l]);
                    }
                }
            }
            exp = exp.OrderByDescending(v => v).Take(k).ToList();

            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }

        [TestMethod]
        public void Test_Rnd3()
        {
            var rnd = new Random();
            var x = 1;
            var y = 3;
            var z = 21;
            var k = 3;
            var a = Enumerable.Range(0, x).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var b = Enumerable.Range(0, y).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var c = Enumerable.Range(0, z).Select(v => ((long)rnd.Next() << 32 | (long)rnd.Next()) + 1).ToList();
            var exp = new List<long>();

            for (int i = 0; i < x; i++)
            {
                for (int j = 0; j < y; j++)
                {
                    for (int l = 0; l < z; l++)
                    {
                        exp.Add(a[i] + b[j] + c[l]);
                    }
                }
            }
            exp = exp.OrderByDescending(v => v).Take(k).ToList();

            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }


        [TestMethod]
        public void Test3()
        {
            var x = 3;
            var y = 3;
            var z = 3;
            var k = 5;
            var a = new List<long> { 10, 10, 10 };
            var b = new List<long> { 0, 0, 0 };
            var c = new List<long> { 0, 0, 0 };
            var exp = new List<long> { 10, 10, 10, 10, 10 };
            var ans = Program.GetAns(k, x, y, z, a, b, c);
            Assert.IsTrue(IsEq(exp, ans));
        }

        bool IsEq(IEnumerable<int> l1, IEnumerable<int> l2)
        {
            if (l1.Count() != l2.Count()) return false;
            for(int i=0; i>l1.Count(); i++)
            {
                if (l1.ElementAt(i) != l2.ElementAt(i)) return false;
            }
            return true;
        }

        bool IsEq(IEnumerable<long> l1, IEnumerable<long> l2)
        {
            if (l1.Count() != l2.Count()) return false;
            for (int i = 0; i > l1.Count(); i++)
            {
                if (l1.ElementAt(i) != l2.ElementAt(i)) return false;
            }
            return true;
        }

        bool IsEq(IEnumerable<double> l1, IEnumerable<double> l2)
        {
            if (l1.Count() != l2.Count()) return false;
            for (int i = 0; i > l1.Count(); i++)
            {
                if (l1.ElementAt(i) != l2.ElementAt(i)) return false;
            }
            return true;
        }

        bool IsEq(double d1, double d2)
        {
            return Math.Abs(d2 - d1) < 1E10;
        }

    }
#endif

    namespace IO
    {
        using System.IO;
        using System.Text;
        using System.Globalization;

        public class Printer : StreamWriter
        {
            static Printer()
            {
                Out = new Printer(Console.OpenStandardOutput()) { AutoFlush = false };
            }

            public static Printer Out { get; set; }

            public override IFormatProvider FormatProvider
            {
                get { return CultureInfo.InvariantCulture; }
            }

            public Printer(Stream stream)
                : base(stream, new UTF8Encoding(false, true))
            {
            }

            public Printer(Stream stream, Encoding encoding)
                : base(stream, encoding)
            {
            }

            public void Write<T>(string format, T[] source)
            {
                base.Write(format, source.OfType<object>().ToArray());
            }

            public void WriteLine<T>(string format, T[] source)
            {
                base.WriteLine(format, source.OfType<object>().ToArray());
            }
        }

        public class StreamScanner
        {
            public StreamScanner(Stream stream)
            {
                str = stream;
            }

            public readonly Stream str;
            private readonly byte[] buf = new byte[1024];
            private int len, ptr;
            public bool isEof;

            public bool IsEndOfStream
            {
                get { return isEof; }
            }

            private byte read()
            {
                if (isEof) return 0;
                if (ptr < len) return buf[ptr++];
                ptr = 0;
                if ((len = str.Read(buf, 0, 1024)) > 0) return buf[ptr++];
                isEof = true;
                return 0;
            }

            public char Char()
            {
                byte b;
                do b = read(); while ((b < 33 || 126 < b) && !isEof);
                return (char)b;
            }

            public string Scan()
            {
                var sb = new StringBuilder();
                for (var b = Char(); b >= 33 && b <= 126; b = (char)read())
                    sb.Append(b);
                return sb.ToString();
            }

            public string ScanLine()
            {
                var sb = new StringBuilder();
                for (var b = Char(); b != '\n'; b = (char)read())
                    if (b == 0) break;
                    else if (b != '\r') sb.Append(b);
                return sb.ToString();
            }

            public long Long()
            {
                if (isEof) return long.MinValue;
                long ret = 0;
                byte b;
                var ng = false;
                do b = read(); while (b != 0 && b != '-' && (b < '0' || '9' < b));
                if (b == 0) return long.MinValue;
                if (b == '-')
                {
                    ng = true;
                    b = read();
                }
                for (; ; b = read())
                {
                    if (b < '0' || '9' < b)
                        return ng ? -ret : ret;
                    ret = ret * 10 + b - '0';
                }
            }

            public int Integer()
            {
                return (isEof) ? int.MinValue : (int)Long();
            }

            public double Double()
            {
                var s = Scan();
                return s != "" ? double.Parse(s, CultureInfo.InvariantCulture) : double.NaN;
            }

            static T[] enumerate<T>(int n, Func<T> f)
            {
                var a = new T[n];
                for (int i = 0; i < n; ++i) a[i] = f();
                return a;
            }

            public char[] Char(int n)
            {
                return enumerate(n, Char);
            }

            public string[] Scan(int n)
            {
                return enumerate(n, Scan);
            }

            public double[] Double(int n)
            {
                return enumerate(n, Double);
            }

            public int[] Integer(int n)
            {
                return enumerate(n, Integer);
            }

            public long[] Long(int n)
            {
                return enumerate(n, Long);
            }
        }
    }
}


Measured memory_bytes: 19296