Soldier and Cards

题意翻译

两个人玩牌，首先两个人都拿出自己手牌的最上面的进行拼点，两张拼点牌将都给拼点赢得人，这两张牌放入手牌的顺序是：先放对方的牌再放自己的。若最后有一个人没有手牌了，那么他就输了，求输出拼点的次数和赢得人的编号，如果一直无法结束比赛，则输出-1.

题目描述

Two bored soldiers are playing card war. Their card deck consists of exactly $ n $ cards, numbered from $ 1 $ to $ n $ , all values are different. They divide cards between them in some manner, it's possible that they have different number of cards. Then they play a "war"-like card game. The rules are following. On each turn a fight happens. Each of them picks card from the top of his stack and puts on the table. The one whose card value is bigger wins this fight and takes both cards from the table to the bottom of his stack. More precisely, he first takes his opponent's card and puts to the bottom of his stack, and then he puts his card to the bottom of his stack. If after some turn one of the player's stack becomes empty, he loses and the other one wins. You have to calculate how many fights will happen and who will win the game, or state that game won't end.

输入输出格式

输入格式

First line contains a single integer $ n $ ( $ 2<=n<=10 $ ), the number of cards. Second line contains integer $ k_{1} $ ( $ 1<=k_{1}<=n-1 $ ), the number of the first soldier's cards. Then follow $ k_{1} $ integers that are the values on the first soldier's cards, from top to bottom of his stack. Third line contains integer $ k_{2} $ ( $ k_{1}+k_{2}=n $ ), the number of the second soldier's cards. Then follow $ k_{2} $ integers that are the values on the second soldier's cards, from top to bottom of his stack. All card values are different.

输出格式

If somebody wins in this game, print $ 2 $ integers where the first one stands for the number of fights before end of game and the second one is $ 1 $ or $ 2 $ showing which player has won. If the game won't end and will continue forever output $ -1 $ .

输入输出样例

输入样例 #1

4
2 1 3
2 4 2

输出样例 #1

6 2

输入样例 #2

3
1 2
2 1 3

输出样例 #2

-1

说明

First sample: Second sample: