using System.Collections.Generic;
using System;

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(int maxSize, IComparer<T> comparer)
    {
        _heap = new T[maxSize];
        _comparer = comparer;
    }

    /// <summary>
    /// Priority queue
    /// </summary>
    /// <param name="maxSize">max size</param>
    /// <param name="type">0: asc, 1:desc</param>
    public PriorityQueue(int maxSize, int type = 0)
    {
        _heap = new T[maxSize];
        _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++;
        //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;
    }
}

public class P : IComparable
{
    public long s { get; set; }
    public int i { get; set; }
    public int j { get; set; }
    public int k { get; set; }
    public int CompareTo(object obj)
    {
        var x = (P)obj;
        if (this.s > x.s) return 1;
        else if (this.s == x.s) return 0;
        else return -1;
    }
}

public class Hello
{
    public static void Main()
    {
        string[] line = Console.ReadLine().Trim().Split(' ');
        var x = int.Parse(line[0]);
        var y = int.Parse(line[1]);
        var z = int.Parse(line[2]);
        var K = int.Parse(line[3]);
        line = Console.ReadLine().Trim().Split(' ');
        var a = Array.ConvertAll(line, long.Parse);
        line = Console.ReadLine().Trim().Split(' ');
        var b = Array.ConvertAll(line, long.Parse);
        line = Console.ReadLine().Trim().Split(' ');
        var c = Array.ConvertAll(line, long.Parse);
        Array.Sort(a); Array.Sort(b); Array.Sort(c);
        Array.Reverse(a); Array.Reverse(b); Array.Reverse(c);
        getAns(a, b, c, x, y, z, K);
    }
    static void getAns(long[] a, long[] b, long[] c, int x, int y, int z, int K)
    {
        var pq = new PriorityQueue<P>(30000, 1);
        var used = new bool[x, y, z];
        pq.Push(new P { s = a[0] + b[0] + c[0], i = 0, j = 0, k = 0 });
        used[0, 0, 0] = true;
        var count = 0;
        while (count < K)
        {
            var w = pq.Pop();
            Console.WriteLine(w.s);
            count++;
            if (w.i + 1 < x &&  !used[w.i + 1, w.j, w.k]) { pq.Push(new P { s = a[w.i + 1] + b[w.j] + c[w.k], i = w.i + 1, j = w.j, k = w.k }); used[w.i + 1, w.j, w.k] = true; }
            if ( w.j + 1 < y &&  !used[w.i, w.j + 1, w.k]) { pq.Push(new P { s = a[w.i] + b[w.j + 1] + c[w.k], i = w.i, j = w.j + 1, k = w.k }); used[w.i, w.j + 1, w.k] = true; }
            if ( w.k + 1 < z &&   !used[w.i, w.j, w.k + 1]) { pq.Push(new P { s = a[w.i] + b[w.j] + c[w.k + 1], i = w.i, j = w.j, k = w.k + 1 }); used[w.i, w.j, w.k + 1] = true; }
        }
    }
}

Measured memory_bytes: 986720