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

namespace Competitive
{
    internal class Solution
    {
        public long MOD = 1000000007;
        int X, Y, Z, K;
        long[] A, B, C;
        public void Run()
        {
       
            {
                var line = Input.ReadIntArray();
                X = line[0];
                Y = line[1];
                Z = line[2];
                K = line[3];
            }

            A = Input.ReadLongArray();
            B = Input.ReadLongArray();
            C = Input.ReadLongArray();
            Array.Sort(A);
            Array.Reverse(A);
            Array.Sort(B);
            Array.Reverse(B);
            Array.Sort(C);
            Array.Reverse(C);

            var pushed = new HashSet<Tuple<int, int, int>>();

            var tpl = Tuple.Create(0, 0, 0);
            pushed.Add(tpl);

            PriorityQueue<Data> q = new PriorityQueue<Data>();
            q.Push(new Data(tpl, sum(tpl)));

            while (K > 0)
            {
                var d = q.Pop();
                Console.WriteLine(d.y);

                var t1 = Tuple.Create(d.x.Item1 + 1, d.x.Item2, d.x.Item3);
                var t2 = Tuple.Create(d.x.Item1, d.x.Item2 + 1, d.x.Item3);
                var t3 = Tuple.Create(d.x.Item1, d.x.Item2, d.x.Item3 + 1);
                if (!pushed.Contains(t1) & t1.Item1 < X && t1.Item2 < Y && t1.Item3 < Z)
                {
                    pushed.Add(t1);
                    q.Push(new Data(t1, sum(t1)));
                }
                if (!pushed.Contains(t2) & t2.Item1 < X && t2.Item2 < Y && t2.Item3 < Z)
                {
                    pushed.Add(t2);
                    q.Push(new Data(t2, sum(t2)));
                }
                if (!pushed.Contains(t3) & t3.Item1 < X && t3.Item2 < Y && t3.Item3 < Z)
                {
                    pushed.Add(t3);
                    q.Push(new Data(t3, sum(t3)));
                }
                K--;
            }
        }

        public long sum(Tuple<int, int, int> x)
        {
            return A[x.Item1] + B[x.Item2] + C[x.Item3];
        }
    }

    // libs ----------
    // 比較のみ
    class Data : IComparable<Data>
    {
        public Tuple<int, int, int> x;
        public long y;

        public Data(Tuple<int, int, int> x, long y)
        {
            this.x = x;
            this.y = y;
        }

        public int CompareTo(Data other)
        {
            return y.CompareTo(other.y) * (-1);
        }
    }

    public class PriorityQueue<T> where T : IComparable<T>
    {
        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;
        }
    }

    // common ----------

    internal static class Input
    {
        public static string ReadString()
        {
            string line = Console.ReadLine();
            return line;
        }

        public static int ReadInt()
        {
            string line = Console.ReadLine();
            return int.Parse(line);
        }

        public static int[] ReadIntArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(int.Parse).ToArray();
        }

        public static long ReadLong()
        {
            string line = Console.ReadLine();
            return long.Parse(line);
        }

        public static long[] ReadLongArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(long.Parse).ToArray();
        }

        public static double[] ReadDoubleArray()
        {
            string line = Console.ReadLine();
            return line.Split(' ').Select(double.Parse).ToArray();
        }
    }

    internal class Program
    {
        public static void Main(string[] args)
        {
            var s = new Solution();
            s.Run();
        }
    }
}

Measured memory_bytes: 16480