Equal Total Scores

Taro and Hanako each hold several cards, and every card has a score printed on it. They want to make the total score of the cards in their hands equal by exchanging exactly one of Taro's cards for exactly one of Hanako's cards. Decide which card should be swapped for which.

They must exchange a pair of cards even when their total scores are already equal.

The input consists of several datasets. Each dataset has the following format:

n m
s1
s2
...
sn
sn+1
sn+2
...
sn+m

The first line contains two integers $n$ and $m$ separated by a space, where $n$ is the number of cards Taro has and $m$ is the number of cards Hanako has. The next $n+m$ lines give one score per line: the first $n$ scores ($s_1$ to $s_n$) are Taro's cards, and the remaining $m$ scores ($s_{n+1}$ to $s_{n+m}$) are Hanako's.

Both $n$ and $m$ are positive integers no greater than $100$, and each score is a non-negative integer no greater than $100$.

The end of the input is a line containing two zeros separated by a single space; do not process it.

For each dataset, print one line with two integers separated by a single space: the score of the card Taro gives to Hanako, followed by the score of the card Hanako gives to Taro. If several exchanges make the totals equal, print the pair whose sum is the smallest.

If no exchange can make the totals equal, print a single line containing only $-1$. The output must not contain any extra characters.