#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

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.

## Input

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 -10,000 and not larger than 10,000. The elements of the first set are listed first, followed by the elements of the second set, etc.

## Output

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.## Sample Input 1

3 2 4 2 5 17 -8 -13 19 6 -9 10 0 -14 7

## Sample Output 1

17 -13 10 -14

## Explanation for Sample Output 1

The four sets are {5,17,-8}, {-13,19}, {6,-9,10,0} and {-14,7}. Picking the four integers 17, -13, 10, -14 produces a sum equal to zero.
Your browser does not support embedded PDF files. Please download the PDF instead.

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 5 | 1s | 32MB | Average |

2 | 0 | 1 | 1s | 32MB | Average |

### Judge Compile Command

g++-7 ans.cpp -o 4sum -Wall -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512