output_description: Print K lines. The i-th line should contain the i-th value stated in the
  problem statement.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      X Y Z K
      A_1 \ A_2 \ A_3 \ ... \ A_X
      B_1 \ B_2 \ B_3 \ ... \ B_Y
      C_1 \ C_2 \ C_3 \ ... \ C_Z
attempt: import sys
  
  read = sys.stdin.buffer.read
  input = sys.stdin.buffer.readline
  inputs = sys.stdin.buffer.readlines
  # rstrip().decode('utf-8')
  
  # import math
  import numpy as np
  
  # import operator
  # import bisect
  # from heapq import heapify,heappop,heappush
  # from math import gcd
  # from fractions import gcd
  # from collections import deque
  # from collections import defaultdict
  # from collections import Counter
  # from itertools import accumulate
  # from itertools import groupby
  # from itertools import permutations
  # from itertools import combinations
  # from scipy.sparse import csr_matrix
  # from scipy.sparse.csgraph import floyd_warshall
  # from scipy.sparse.csgraph import csgraph_from_dense
  # from scipy.sparse.csgraph import dijkstra
  # sys.setrecursionlimit(10**7)
  
  # map(int,input().split())
  
  
  def main():
      x, y, z, k = map(int, input().split())
      ABC = np.array(read().split(), np.int64)
      A = ABC[:x]
      B = ABC[x:-z]
      C = ABC[-z:]
      AB = np.add.outer(A, B)
      AB = AB.ravel()
      AB.sort()
      AB = AB[-k:]
  
      ans = np.add.outer(AB, C)
      ans = ans.ravel()
      ans.sort()
  
      for i in range(k):
          print(ans[-i - 1])
  
  
  if __name__ == "__main__":
      main()
  
problem_description: Statement
  
  The Patisserie AtCoder sells cakes with number-shaped candles. There are X, Y
  and Z kinds of cakes with 1-shaped, 2-shaped and 3-shaped candles,
  respectively. Each cake has an integer value called _deliciousness_ , as
  follows:
  
    * The deliciousness of the cakes with 1-shaped candles are A_1, A_2, ..., A_X.
    * The deliciousness of the cakes with 2-shaped candles are B_1, B_2, ..., B_Y.
    * The deliciousness of the cakes with 3-shaped candles are C_1, C_2, ..., C_Z.
  
  Takahashi decides to buy three cakes, one for each of the three shapes of the
  candles, to celebrate ABC 123.  
  There are X \times Y \times Z such ways to choose three cakes.  
  We will arrange these X \times Y \times Z ways in descending order of the sum
  of the deliciousness of the cakes.  
  Print the sums of the deliciousness of the cakes for the first, second, ...,
  K-th ways in this list.
samples: [{"input": "2 2 2 8\n    4 6\n    1 5\n    3 8", "output": "19\n    17\n    15\n    14\n    13\n    12\n    10\n    8\n    \n\nThere are 2 \\times 2 \\times 2 = 8 ways to choose three cakes, as shown below\nin descending order of the sum of the deliciousness of the cakes:\n\n  * (A_2, B_2, C_2): 6 + 5 + 8 = 19\n  * (A_1, B_2, C_2): 4 + 5 + 8 = 17\n  * (A_2, B_1, C_2): 6 + 1 + 8 = 15\n  * (A_2, B_2, C_1): 6 + 5 + 3 = 14\n  * (A_1, B_1, C_2): 4 + 1 + 8 = 13\n  * (A_1, B_2, C_1): 4 + 5 + 3 = 12\n  * (A_2, B_1, C_1): 6 + 1 + 3 = 10\n  * (A_1, B_1, C_1): 4 + 1 + 3 = 8\n\n* * *"}, {"input": "3 3 3 5\n    1 10 100\n    2 20 200\n    1 10 100", "output": "400\n    310\n    310\n    301\n    301\n    \n\nThere may be multiple combinations of cakes with the same sum of the\ndeliciousness. For example, in this test case, the sum of A_1, B_3, C_3 and\nthe sum of A_3, B_3, C_1 are both 301. However, they are different ways of\nchoosing cakes, so 301 occurs twice in the output.\n\n* * *"}, {"input": "10 10 10 20\n    7467038376 5724769290 292794712 2843504496 3381970101 8402252870 249131806 6310293640 6690322794 6082257488\n    1873977926 2576529623 1144842195 1379118507 6003234687 4925540914 3902539811 3326692703 484657758 2877436338\n    4975681328 8974383988 2882263257 7690203955 514305523 6679823484 4263279310 585966808 3752282379 620585736", "output": "23379871545\n    22444657051\n    22302177772\n    22095691512\n    21667941469\n    21366963278\n    21287912315\n    21279176669\n    21160477018\n    21085311041\n    21059876163\n    21017997739\n    20703329561\n    20702387965\n    20590247696\n    20383761436\n    20343962175\n    20254073196\n    20210218542\n    20150096547\n    \n\nNote that the input or output may not fit into a 32-bit integer type."}]