#include <bits/stdc++.h>
using namespace std;
// define
#define int long long
#define UNIQUE(v) v.erase(unique(all(v)), v.end());
#define ZIP(v) sort(all(v)),UNIQUE(v)
#define ADD(a, b) a = (a + b) % mod
#define SUB(a, b) a = (a+mod-b)%mod
#define MUL(a, b) a = (((a)%mod) * ((b)%mod)) % mod
#define rollcall cout << "I'm Sucu." << endl;
#define repi(i,m,n) for(int i = m;i < n;i++)
#define drep(i,n,m) for(int i = n;i >= m;i--)
#define rep(i,n) repi(i,0,n)
#define rrep(i,n) repi(i,1,n+1)
#define chmin(x,y) x = min(x,y)
#define chmax(x,y) x = max(x,y)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(), v.rend()
#define dmp(x,y) make_pair(x,y)
#define pb(x) push_back(x)
#define pf(x) push_front(x)
#define fi first
#define se second
// debug
template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
  os << "(" << p.first << "," << p.second << ")";return os;
}
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
  for (auto it = v.begin();it != v.end();++it){
    if(it != v.begin())os << " ";os << *it;
  }return os;
}
template <typename T, typename U>
ostream &operator<<(ostream &os, const map<T, U> &mp){
  for(auto x: mp)os << "(" << x.first << "," << x.second << ")" << endl;
  return os;
}
template<typename T, int SIZE>
int array_length(const T (&)[SIZE]){return SIZE;}
template<typename T, int N>
void PRINTF(const T (&a)[N], int s = N, int t = -1, bool f = true){
	if(t == -1){rep(i,s){if(i)cout << " ";cout << a[i];}}
	else repi(i,s,t){if(i!=s)cout << " ";cout << a[i];}
	if(f)cout << "\n";
}
template<typename T, int N1, int N2>
void PRINTF(const T (&a)[N1][N2], int h = N1, int w = N2){
	rep(i,h){rep(j,w){cout << a[i][j] << " \n"[j==w-1];}}
}
string substr(const string &str, int S1, int S2 = -1){
  if(S2 == -1)return str.substr(S1);
  return str.substr(S1, S2-S1);
}
// typedef
typedef complex<double> Point;
typedef pair<int, int> P;
typedef pair<int, P> PP;
typedef pair<P, int> Pi;
typedef vector<int> vi;
typedef deque<int> dq;
const int inf = 1e9+7;
const int INF = 1e18+7;
// int sum = accumulate(a, a+n, 0LL);
// int mx = max_element(a, a+n);
// int mn = min_element(a, a+n);
// int cnt = count(a, a+n, k);


vector<int> vec[3];
typedef tuple<int, int, int> TT;
#define dmt(x, y, z) make_tuple(x, y, z)
typedef pair<int, TT> Pa;
priority_queue<Pa> q;
map<TT, int> mp;

signed main(){
  int x, y, z, k;cin >> x >> y >> z >> k;
  vec[0].resize(x+1);
  vec[1].resize(y+1);
  vec[2].resize(z+1);
  rep(i,x)cin >> vec[0][i];vec[0][x] = -INF;
  rep(i,y)cin >> vec[1][i];vec[1][y] = -INF;
  rep(i,z)cin >> vec[2][i];vec[2][z] = -INF;
  rep(i,3)sort(all(vec[i]), greater<int>());
  
  q.push(Pa(vec[0][0]+vec[1][0]+vec[2][0], dmt(0, 0, 0)));
  vector<int> ans;
  while(!q.empty()){
    Pa p = q.top();q.pop();
    int value = p.fi, a = get<0>(p.se), b = get<1>(p.se), c = get<2>(p.se);
    TT t[3];int v[3];
    rep(i,3){
      t[i] = dmt(a+(i==0), b+(i==1), c+(i==2));
      v[i] = vec[0][a+(i==0)] + vec[1][b+(i==1)] + vec[2][c+(i==2)];
    }
    rep(i,3)if(mp[t[i]] == 0){q.push(Pa(v[i], t[i]));mp[t[i]] = 1;}
    ans.pb(value);
    if(ans.size() == k)break;
  }
  rep(i,k)cout << ans[i] << endl;
  return 0;
}






Measured memory_bytes: 1152