import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;


void main() {
    int X, Y, Z, K;
    scan(X, Y, Z, K);
    auto a = readln.split.to!(long[]).sort();
    auto b = readln.split.to!(long[]).sort();
    auto c = readln.split.to!(long[]).sort();

    alias Cake = Tuple!(long, "v", int, "i", int, "j", int, "k");

    auto bh = new BinaryHeap!(Array!Cake, "a.v < b.v")();
    foreach (i ; 0 .. X) {
        foreach (j ; 0 .. Y) {
            bh.insert(Cake(a[i] + b[j] + c[$ - 1], i, j, Z - 1));
        }
    }

    foreach (_ ; 0 .. K) {
        auto ck = bh.front;
        bh.popFront();
        writeln(ck.v);

        int i = ck.i, j = ck.j, k = ck.k;
        if (k > 0) {
            bh.insert(Cake(a[i] + b[j] + c[k - 1], i, j, k - 1));
        }
    }
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}
