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

typedef long long ll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
typedef vector<vector<vector<bool>>> vvvb;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef vector<double> vd;
typedef vector<vd> vdd;

#define FOR(i,x,y) for(ll i=(ll)x; i<(ll)y; ++i)
#define REP(i,y) FOR(i, 0, y)
#define RFOR(i,x,y) for(ll i=(ll)x; i>=(ll)y; --i)
#define RREP(i,x) RFOR(i, x, 0)
#define ALL(a) a.begin(), a.end()
#define pb push_back
#define debug_print(x...) cerr << "line " << __LINE__ << " : "; debug_print_in(x);

template <typename First>
void debug_print_in(First first){
  cerr << first << endl;
  return;
}

template <typename First, typename... Rest>
void debug_print_in(First first, Rest... rest){
  cerr << first << " ";
  debug_print_in(rest...);
  return;
}

void IN(void){
  return;
}

template <typename First, typename... Rest>
void IN(First& first, Rest&... rest){
  cin >> first;
  IN(rest...);
  return;
}

template <typename First>
void OUT(First first){
  cout << first << endl;
  return;
}

template <typename First, typename... Rest>
void OUT(First first, Rest... rest){
  cout << first << " ";
  OUT(rest...);
  return;
}

template<class t, class u> void chmax(t&a,u b){if(a<b)a=b;};
template<class t, class u> void chmin(t&a,u b){if(a>b)a=b;};
int popcount(int t){return __builtin_popcount(t);} //GCC
int popcount(ll t){return __builtin_popcountll(t);} //GCC

template <typename T>
void vec_print(vector<T> VEC){
  REP(i, VEC.size()){
    cerr << VEC[i] << " ";
  }
  cerr << endl;
};

template <typename T>
void mat_print(vector<vector<T> > MAT){
  REP(i,MAT.size()){
    REP(j,MAT[i].size()){
      cerr << MAT[i][j] << " ";
    }
    cerr << endl;
  }
};

constexpr int INF = (1<<30);
constexpr ll INFLL = 1LL<<62;
constexpr long double EPS = 1e-12;
constexpr ll MOD = (ll)((1E+9)+7);

ll check(const vll& A, const vll& B, ll val){
  ll ans = 0;
  ll N = A.size();
  REP(i,A.size()){
    ans += B.size()-(lower_bound(B.begin(), B.end(), val-A[i]) - B.begin());
  }
  return ans;
}

ll binary_search(const vll& A, const vll& B, ll lower, ll upper, ll val){
  if(upper==lower) return upper;
  if(upper-lower==1){
    if(check(A, B, upper)==val) return upper;
    return lower;
  }
  ll mid = (upper+lower)/2;
  if(check(A,B,mid)>=val) return binary_search(A,B,mid,upper,val);
  return binary_search(A,B,lower,mid,val);
}

int main(){
  cin.tie(0); // cut the cin and cout (default, std::flush is performed after std::cin)
  ios::sync_with_stdio(false); // cut the iostream and stdio (DON'T endl; BUT "\n";)

  ll X, Y, Z, K;
  IN(X,Y,Z,K);
  vll A(X), B(Y), C(Z);
  REP(i,X) IN(A[i]);
  REP(i,Y) IN(B[i]);
  REP(i,Z) IN(C[i]);

  if(X<Z) swap(A,C);
  if(Y<Z) swap(B,C);

  vll AB(X*Y);
  REP(i,X) REP(j,Y) AB[i*Y+j] = A[i]+B[j];

  sort(ALL(AB));
  sort(ALL(C));

  ll M = binary_search(C, AB, AB[0]+C[0], AB[AB.size()-1]+C[C.size()-1], K);

  vll ans;
  REP(i,C.size()){
    ll index = lower_bound(AB.begin(), AB.end(), M-C[i]) - AB.begin();
    FOR(j,index,AB.size()) ans.pb(C[i]+AB[j]);
  }

  sort(ALL(ans));
  reverse(ALL(ans));
  REP(i,K){
    printf("%lld\n", ans[i]);
  }

  return 0;
}

Measured memory_bytes: 272092