#include <bits/stdc++.h>
using namespace std;

// #include <boost/algorithm/string/join.hpp>
// using boost::algorithm::join;
//
// #include "boost/multi_array.hpp"
// boost::multi_array<int, 3> dp;
// dp.resize(boost::extents[10][9][8]);
//
// #include <boost/multiprecision/cpp_dec_float.hpp>  // quite slow
// #include <boost/multiprecision/cpp_int.hpp>
// namespace mp = boost::multiprecision; // mp::log10
// using bigint = boost::multiprecision::cpp_int;

typedef long long ll;
typedef unsigned long long ull;
//typedef long double ld;

typedef map<int, int> mii;
typedef pair<int, int> pii;
typedef pair<double,double> pdd;
typedef set<int> si;
typedef set<ll> sll;
typedef vector<int> vi;
typedef vector<pair<int, int > > vii;
typedef vector<ll> vll;
typedef vector<double> vd;
typedef vector<vi> vvi;
typedef vector<vii> vvii;
typedef vector<vll> vvll;

//constexpr ll MOD = 1e9+7;
template<typename T>constexpr auto inf=numeric_limits<T>::max()/4;
constexpr int INF=inf<int>;
constexpr ll LINF=inf<ll>;

#define Sort(x) sort(begin(x),end(x))
#define Reverse(x) reverse(begin(x),end(x))
#define ABS(a,b) ((a)<(b)?(b)-(a):(a)-(b))
#define nbit(n) (1ull<<(n))
#define _ol3(_1,_2,_3,name,...)name
#define _rep(i,n)_repi(i,0,n)
#define _repi(i,a,b)for(int i=a,i##_l=(b);i<i##_l;++i)
#define REP(...) _ol3(__VA_ARGS__,_repi,_rep,)(__VA_ARGS__)
#define REPR(i,n) for(int i=n-1;i>=0;--i)
#define REPA(i,v) REP(i,(v).size())

// sort(begin(x), end(x), greater<ll>());
// lower_bound(a.begin(), a.end(), val): a[i] ≥ valである最左の位置
// upper_bound(a.begin(), a.end(), val): a[i] > valである最左の位置

// Returns minimum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmin(T& a, T b) {
  if (a > b) {
    a = b;
  }
  return a;
}

// Returns maximum of a and b.
// If a is less b, a is set to b.
template<typename T>
T chmax(T& a, T b) {
  if (a < b) {
    a = b;
  }
  return a;
}

template <typename T>
void dumpContents(const T& v, const string& msg)
{
  cerr << "### " << msg << " ###\n";
  for (const auto& x : v) {
    cerr << x << " ";
  }
  cerr << endl;
}

struct before_main_function {
  before_main_function() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout<<setprecision(20)<<fixed;
#define endl "\n"
  }
} before_main_function;

// ========== end of template ==========
vll A, B, C;

struct Element {
  ll x, y, z, value;

  Element(ll _x, ll _y, ll _z)
    : x(_x), y(_y), z(_z),
      value(A[x] + B[y] + C[z]) {}
};


int main(int argc, char** argv) {
  int X, Y, Z, K;
  cin >> X >> Y >> Z >> K;
  A.resize(X);
  B.resize(Y);
  C.resize(Z);
  for (auto& a : A) {
    cin >> a;
  }
  for (auto& b : B) {
    cin >> b;
  }
  for (auto& c : C) {
    cin >> c;
  }

  Sort(A); Reverse(A);
  Sort(B); Reverse(B);
  Sort(C); Reverse(C);

  auto cmp = [](const Element& lhs, const Element& rhs) {
    return lhs.value < rhs.value;
  };

  priority_queue<Element, vector<Element>, decltype(cmp)> q(cmp);
  q.push({0,0,0});

  set<tuple<int, int, int> > visited;

  while(int(visited.size())<K) {
    const Element e = q.top(); q.pop();
    tuple<int, int, int> t = make_tuple(e.x, e.y, e.z);
    if (visited.count(t)) continue;

    //cerr << e.x << ", " << e.y << ", " << e.z << endl;
    cout << e.value << endl;

    visited.insert(t);

    if (e.x < X-1) {
      q.push({e.x+1, e.y, e.z});
    }
    if (e.y < Y-1) {
      q.push({e.x, e.y+1, e.z});
    }
    if (e.z < Z-1) {
      q.push({e.x, e.y, e.z+1});
    }
  }


  return 0;
}

/* vim: set expandtab shiftwidth=2 softtabstop=2 : */


Measured memory_bytes: 768