#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <deque>
#include <fstream>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#define len(X) ((int)(X).size())

#ifdef __LOCAL
#define DBG(X) cout << #X << "=" << (X) << '\n';
#define SAY(X) cout << (X) << '\n';
#else
#define DBG(X)
#define SAY(X)
#endif

#define M_PI       3.14159265358979323846

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);

const int NIL = -1;
static mt19937 _g(time(nullptr));

std::string pad(int num)
{
    char buffer[4];
    std::snprintf(buffer, sizeof(buffer), "%03d", num);
    return buffer;
}

inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

#ifdef _MSC_VER
#  include <intrin.h>
#  define __builtin_popcount __popcnt
#endif

int solve()
{
    int x, y, z, k;
    cin >> x >> y >> z >> k;

    vector<ll> a = fetch_vec<ll>(x);
    vector<ll> b = fetch_vec<ll>(y);
    vector<ll> c = fetch_vec<ll>(z);

    std::sort(a.begin(), a.end(), std::greater<ll>());
    std::sort(b.begin(), b.end(), std::greater<ll>());
    std::sort(c.begin(), c.end(), std::greater<ll>());

    vector<vector<vector<bool>>> added(x, vector<vector<bool>>(y, vector<bool>(z, false)));
    priority_queue<vector<ll>> pq;
    pq.push({a[0]+b[0]+c[0], 0, 0, 0});
    added[0][0][0] = true;

    vector<ll> out;

    while (!pq.empty() && out.size() < k)
    {
        auto v = pq.top();
        pq.pop();
        out.push_back(v[0]);

        if (v[1] + 1 < x && !added[v[1] + 1][v[2]][v[3]])
        {
            pq.push({ a[v[1] + 1] + b[v[2]] + c[v[3]], v[1] + 1, v[2], v[3] });
            added[v[1] + 1][v[2]][v[3]] = true;
        }
        if (v[2] + 1 < y && !added[v[1]][v[2]+1][v[3]])
        {
            pq.push({ a[v[1]] + b[v[2]+1] + c[v[3]], v[1], v[2]+1, v[3] });
            added[v[1]][v[2]+1][v[3]] = true;
        }
        if (v[3] + 1 < z && !added[v[1]][v[2]][v[3]+1])
        {
            pq.push({ a[v[1]] + b[v[2]] + c[v[3]+1], v[1], v[2], v[3]+1 });
            added[v[1]][v[2]][v[3]+1] = true;
        }
    }

    for (int i = 0; i < k; ++i)
        cout << out[i] << endl;

    return 0;
}

int main()
{
    solve();

    return 0;
}

Measured memory_bytes: 180480