#include<bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (n); i++)
#define ll long long
using namespace std;

int main() {
  int x,y,z,K; cin>>x>>y>>z>>K;
  vector<ll> a(x),b(y),c(z);
  rep(i, x) cin>>a[i];
  rep(i, y) cin>>b[i];
  rep(i, z) cin>>c[i];

  sort(a.begin(), a.end(), greater<ll>());
  sort(b.begin(), b.end(), greater<ll>());
  sort(c.begin(), c.end(), greater<ll>());
  vector<ll> ans;
  rep(i, x) {
    rep(j, y) {
      rep(k, z) {
        if ((i+1)*(j+1)*(k+1)<=K) {
          ans.push_back(a[i]+b[j]+c[k]);
        }
        else break;
      }
    }
  }
  sort(ans.begin(), ans.end(), greater<ll>());
  rep(i, K) cout<<ans[i]<<endl;
  return 0;
}
