#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

using Data = pair<long long, vector<int> >;

// priority queue使うVer

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll X, Y, Z, K;
    cin >> X >> Y >> Z >> K;

    VI A(X);
    rep(i, X) cin >> A[i];
    RSORT(A);

    VI B(Y);
    rep(i, Y) cin >> B[i];
    RSORT(B);

    VI C(Z);
    rep(i, Z) cin >> C[i];
    RSORT(C);

    priority_queue<Data> que;
    Data d = Data(A[0]+B[0]+C[0], {0, 0, 0});
    que.push(d);
    set<Data> se;
    se.insert(d);
    
    while(K--){
      auto d = que.top(); que.pop();
      ll taste = d.first;
      p(taste);

      // if(taste==17){
      //   debug(que.size());
      //   while(!que.empty()){
      //     auto a = que.top(); que.pop();
      //     debug(a);
      //   }
      //   return 0;
      // }

      rep(i, 3){
        ll L;
        if(i==0){
          L = X;
        }else if(i==1){
          L = Y;
        }else{
          L = Z;
        }
        if(d.second[i]+1<L){
          auto indexes = d.second;
          indexes[i]++;
          ll idx = indexes[i];

          ll new_taste;
          if(i==0){
            new_taste = taste + A[idx] - A[idx-1];
          }else if(i==1){
            new_taste = taste + B[idx] - B[idx-1];
          }else{
            new_taste = taste + C[idx] - C[idx-1];
          }
          
          auto da = Data(new_taste, indexes);
          if(se.count(da)==0){
            se.insert(da);
            que.push(da);
          }
        }
      }
    }

    return 0;
}

Measured memory_bytes: 1536