#include <iostream>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <algorithm>
#include <map>
#include <chrono>
#include <math.h>
using namespace std;

using lli = long long int;
using Vint = std::vector<int>;
using Vlli = std::vector<lli>;
using Wint = std::vector<Vint>;
using Wlli = std::vector<Vlli>;
using Vbool = std::vector<bool>;
using pii = std::pair<int, int>;
using pll = std::pair<lli, lli>;

constexpr int MOD = 1e9 + 7;
constexpr int INFi = 2e9 + 1;
constexpr lli INFl = (lli)(9e18) + 1;
const vector<pii> DXDY = {std::make_pair(1, 0), std::make_pair(-1, 0), std::make_pair(0, 1), std::make_pair(0, -1)};
constexpr char BR = '\n';

#define FOR(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
#define FOReq(i, a, b) for(int (i) = (a); (i) <= (b); (i)++)
#define rFOR(i, a, b) for(int (i) = (b); (i) >= (a); i--)
#define FORstep(i, a, b, step) for(int (i) = (a); i < (b); i += (step))
#define REP(i, n) FOR(i, 0, n)
#define rREP(i, n) rFOR(i, 0, (n-1))
#define vREP(ele, vec) for(auto &(ele) : (vec))
#define vREPcopy(ele, vec) for(auto (ele) : (vec))
#define SORT(A) std::sort((A).begin(), (A).end())



template <class T> inline int argmin(vector<T> vec){return min_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline int argmax(vector<T> vec){return max_element(vec.begin(), vec.end()) - vec.begin();}
template <class T> inline void chmax(T &a, T b){a = max(a, b);}
template <class T> inline void chmin(T &a, T b){a = min(a, b);}
inline int toInt(string &s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline int toInt(const string s){int res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(string &s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
inline long long int toLong(const string s){lli res = 0; for(char a : s) res = 10 * res + (a - '0'); return res;}
template <class T> inline std::string toString(T n){
  if(n == 0) return "0";
  std::string res = "";
  if(n < 0){n = -n;while(n != 0){res += (char)(n % 10 + '0'); n /= 10;}
  std::reverse(res.begin(), res.end()); return '-' + res;}
  while(n != 0){res += (char)(n % 10 + '0'); n /= 10;} std::reverse(res.begin(), res.end()); return res;
}

// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~


Vlli A, B, C, AB;


int main(void){
  int x, y, z, k; scanf("%d %d %d %d\n", &x, &y, &z, &k);
  A.resize(x); B.resize(y); C.resize(z);
  AB.resize(x * y);
  vREP(ele, A) scanf("%lld", &ele); getchar();
  vREP(ele, B) scanf("%lld", &ele); getchar();
  vREP(ele, C) scanf("%lld", &ele);
  REP(i, x) REP(j, y) AB.at(i * y + j) = A.at(i) + B.at(j);
  sort(AB.begin(), AB.end());
  sort(C.begin(), C.end());
  int i = x * y - 1, j = z-1, push_number = 0;
  using Position = pair<int, int>;
  priority_queue<pair<lli, Position>> datum;
  set<Position> done;
  datum.push(make_pair(AB.at(i) + C.at(j), make_pair(i, j)));
  REP(_, k){
    const pair<lli, Position> K = datum.top(); datum.pop();
    printf("%lld\n", K.first);
    lli x = K.second.first, y = K.second.second;
    if(x != 0){
      Position ACC = make_pair(x-1, y);
      if(done.count(ACC) == 0){
        done.insert(ACC);
        datum.push(make_pair(AB.at(x-1)+C.at(y), ACC));
      }
    }
    if(y != 0){
      Position ACC = make_pair(x, y-1);
      if(done.count(ACC) == 0){
        done.insert(ACC);
        datum.push(make_pair(AB.at(x) + C.at(y-1), ACC));
      }
    }
  }
  return 0;
}

Measured memory_bytes: 8448