4SUM | 프로그래밍의 벗 PivotOJ
PivotOJ

4SUM

시간 제한: 2000ms메모리 제한: 512MB출처: NOI 2008BOJ 9847

문제

In this task, you are provided with four sets of integers. Your task consists of selecting one integer from each set, such that their sum is 0. You can assume that exactly one such selection exists.

입력

The first line of input contains four numbers, a, b, c, and d, separated by a space character, indicating the number of elements in each of the four sets. Each of these numbers is a positive integer 1 ≤ a, b, c, d ≤ 500. The following a + b + c + d lines contain the elements, each not smaller than −60000 and not larger than 60000. The elements of the first set are listed first, followed by the elements of the second set, etc.

출력

The output consists of the four integers, separated by a space character. The numbers must appear in the order in which they are listed in the input file.

예제

예제 1

입력
3 2 4 2
5
17
-8
-13
19
6
-9
10
0
-14
7
출력
17 -13 10 -14
코드를 제출하려면 로그인하세요.