#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL, LL> PII;

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

template <typename T>
function<T(T, T)> op_max = [](T a, T b) -> T { return max(a, b); };
template <typename T>
function<T(T, T)> op_min = [](T a, T b) -> T { return min(a, b); };

template <typename T>
function<T(T, T)> op_sum = [](T a, T b) -> T { return a + b; };

namespace detail
{
  template <typename T, std::size_t NDIMS>
  struct vector_builder
  {
    using type = std::vector<typename vector_builder<T, NDIMS - 1>::type>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      const auto vec = std::vector<T>(dims.empty() ? 0 : dims.back(), v);
      if (!dims.empty())
        dims.pop_back();
      return vector_builder<std::vector<T>, NDIMS - 1>::make(dims, vec);
    }
  };

  template <typename T>
  struct vector_builder<T, 1>
  {
    using type = std::vector<T>;

    static type make(std::vector<std::size_t> dims, const T &v = {})
    {
      return type(dims.empty() ? 0 : dims.back(), v);
    }
  };
} // namespace detail

template <typename T, typename... SIZE_T>
auto exvector(const T &v, SIZE_T... dims)
{
  static_assert(sizeof...(dims) != 0, "invalid dimension");
  std::vector<std::size_t> vec_dims{dims...};
  return detail::vector_builder<T, sizeof...(dims)>::make(vec_dims, v);
}

using namespace std;
//********************  dumps ************************//

template <typename T>
void dump(const T &data, vector<int> &iter)
{
  cout << data << " ";
}
template <typename T>
void dump(const vector<T> &data, vector<int> &iter)
{
  for (auto elem : data)
    dump(elem, iter);
  cout << endl;
}

template <typename T>
void dump(const vector<vector<T>> &data, vector<int> &iter)
{
  for (auto elem : iter)
  {
    cout << "[" << elem << "]";
  }
  cout << endl;
  for (int i = 0; i < data.size(); i++)
  {
    iter.push_back(i);
    dump(data[i], iter);
    iter.pop_back();
  }
  cout << endl;
}

template <typename T>
void dump(const vector<T> &data, int dummy)
{
  for (int i = 0; i < data.size(); i++)
  {
    cout << "[" << i << "] " << data[i] << endl;
  }
}
template <typename T>
void dump(const T &data)
{ // T : data, U = base type val.
  vector<int> iter;
  dump(data, iter);
}
///////////////////////////////////////////////

void solve(long long X, long long Y, long long Z, long long K, std::vector<long long> A, std::vector<long long> B, std::vector<long long> C)
{

  sort(A.begin(), A.end());
  sort(B.begin(), B.end());
  sort(C.begin(), C.end());
  set<vector<LL>> used;

  typedef pair<LL, vector<LL>> DATA;
  priority_queue<DATA> qu;
  qu.push(make_pair(A.back() + B.back() + C.back(), vector<LL>{X - 1, Y - 1, Z - 1}));
  LL ans = 0;
  auto calc = [&](vector<LL> indexes) {
    LL ret = 0;
    ret += A[indexes[0]];
    ret += B[indexes[1]];
    ret += C[indexes[2]];
    return ret;
  };
  while (!qu.empty() && K >= 1)
  {
    auto val = qu.top();
    qu.pop();
    vector<LL> index = val.second;
    if (used.find(index) != used.end())
      continue;
    K--;
    used.insert(index);
    cout << val.first << endl;

    for (int i = 0; i < 3; i++)
      if (index[i] > 0)
      {
        index[i]--;
        LL nxt = calc(index);
        qu.push(make_pair(nxt, index));
        index[i]++;
      }
  }
}

int main()
{
  cout << setprecision(10);
  long long X;
  scanf("%lld", &X);
  long long Y;
  scanf("%lld", &Y);
  long long Z;
  scanf("%lld", &Z);
  long long K;
  scanf("%lld", &K);
  std::vector<long long> A(X);
  for (int i = 0; i < X; i++)
  {
    scanf("%lld", &A[i]);
  }
  std::vector<long long> B(Y);
  for (int i = 0; i < Y; i++)
  {
    scanf("%lld", &B[i]);
  }
  std::vector<long long> C(Z);
  for (int i = 0; i < Z; i++)
  {
    scanf("%lld", &C[i]);
  }
  solve(X, Y, Z, K, std::move(A), std::move(B), std::move(C));
  return 0;
}


Measured memory_bytes: 896