#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iostream>
#include <iterator>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define FOR(i,k,n) for(int(i)=(k);(i)<(n);++(i))
#define rep(i,n) FOR(i,0,n)
#define all(v) begin(v),end(v)
#define debug(x) //std::cerr<<#x<<": "<<x<<"\n"
#define debug2(x,y) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<"\n"
#define debug3(x,y,z) //std::cerr<<#x<<": "<<x<<", "<<#y<<": "<<y<<", "<<#z<<": "<<z<<"\n"

using ll=long long;
using vi=std::vector<int>;
using vvi=std::vector<vi>;
using vll=std::vector<ll>;
using vvll=std::vector<vll>;
template<typename T> using vvec=std::vector<std::vector<T>>;
template<typename T>
auto make_v(size_t sz){return std::vector<T>(sz);}
template<typename T,typename... Ts>
auto make_v(size_t sz,Ts...ts){return std::vector<decltype(make_v<T>(ts...))>(sz,make_v<T>(ts...));}
template<typename T>
void fill_v(T&var,const T&x){var=x;}
template<typename V,typename T>
void fill_v(V&v,const T&x){for(auto&& w:v){fill_v(w,x);}}

template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::vector<std::vector<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<T>&v){
  int sz=v.size();s<<"\n";rep(i,sz){s<<v[i];if(i<sz-1){s<<"\t";}}s<<"\n";return s;}
template<typename T> std::ostream& operator<<(std::ostream&s,const std::deque<std::deque<T>>&v){
  for(auto&& w:v){s<<w;}return s;}
template<typename T> std::ostream& operator<<(std::ostream&s, const std::set<T>&v){
  s<<"\n";for(auto&& elm:v){s<<elm<<"\t";}s<<"\n";return s;}

inline void scan(int&a){scanf("%d",&a);}
inline void scan(ll&a){scanf("%lld",&a);}
inline void scan(char&a){scanf(" %c",&a);}
inline void scan(double&a){scanf("%lf",&a);}
inline void scan(std::string&s){char BUF[3000000];scanf(" %s",BUF);s=std::string(BUF);}
template<typename T>
inline void scan(std::vector<T>&v){for(auto&& sv:v){scan(sv);}}
template<typename First,typename...Args>
inline void scan(First&f,Args&...args){scan(f);scan(args...);}
inline void print(int a){printf("%d\n",a);}
inline void print(ll a){printf("%lld\n",a);}
inline void print(double a){printf("%.12f\n",a);}
inline void print(std::string s){std::cout<<s<<"\n";}

using namespace std;

int main() {
  ll x, y, z, k;
  scan(x, y, z, k);
  vvll abc(3);
  abc[0].resize(x);
  abc[1].resize(y);
  abc[2].resize(z);
  rep (i, 3) {
    scan(abc[i]);
    sort(all(abc[i]));
  }
  vll ab(x*y);
  rep (i, x) {
    rep (j, y) {
      ab[i*y + j] = -(abc[0][i] + abc[1][j]);
    }
  }
  int abs = ab.size();
  sort(all(ab));
  vll c = abc[2];
  int cs = c.size();
  rep (i, cs) {
    c[i] = -c[i];
  }
  sort(all(c));
  debug(ab);
  debug(c);
  ll mind = -1;
  ll maxd = ab[abs-1] - ab[0] + c[cs-1] - c[0];
  while (maxd - mind > 1) {
    ll mid = (mind + maxd + 1) / 2;
    ll cnt = 0;
    rep (i, cs) {
      ll rest = mid - (c[i] - c[0]);
      if (rest < 0) {
        continue;
      }
      int ub = upper_bound(all(ab), ab[0] + rest) - begin(ab);
      cnt += ub;
    }
    if (cnt >= k) {
      maxd = mid;
    } else {
      mind = mid;
    }
  }
  vll ans;
  ans.reserve(1000000);
  rep (i, cs) {
    ll rest = maxd - (c[i] - c[0]);
    if (rest < 0) {
      continue;
    }
    rep (j, abs) {
      if (ab[j] - ab[0] > rest) {
        break;
      }
      ans.push_back(c[i] + ab[j]);
    }
  }
  debug(ans.size());
  assert ((int)ans.size() >= k);
  sort(all(ans));
  rep (i, k) {
    print(-ans[i]);
  }

  return 0;
}


Measured memory_bytes: 134872