CodeForces - 546C Soldier and Cards 模拟

Two bored soldiers are playing card war. Their card deck consists of exactly ncards, 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.

Input

First line contains a single integer n (2 ≤ n ≤ 10), the number of cards.

Second line contains integer k1 (1 ≤ k1 ≤ n - 1), the number of the first soldier's cards. Then follow k1 integers that are the values on the first soldier's cards, from top to bottom of his stack.

Third line contains integer k2 (k1 + k2 = n), the number of the second soldier's cards. Then follow k2 integers that are the values on the second soldier's cards, from top to bottom of his stack.

All card values are different.

Output

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.

Examples

Input

4
2 1 3
2 4 2

Output

6 2

Input

3
1 2
2 1 3

Output

-1

题意：两个人玩纸牌游戏，每一轮游戏每个人都把自己的第一个牌拿出来比较大小，大的一方先将对面的这个牌放在自己牌的最后，再把自己的牌放在最后，直到一个人没有了纸牌就算那个人输，问一共会进行多少次游戏，以及赢的人的编号。

题解：像这种判断能不能循环完成的，能求出来的就求出来，不能求得，就设一个循环次数，让他循环跑一下，如果还没有停止的话，就可以判定是不能结束的

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=3e5+10;
int n,m;
int main()
{
	queue<int> q1,q2;
	cin>>n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>m;
		q1.push(m);
	}cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>m;
		q2.push(m);
	}
	m=0;
	int x,y;
	while(!q1.empty()&&!q2.empty())
	{
		x=q1.front();q1.pop(); 
		y=q2.front();q2.pop();
		
		if(x>y)
		{
			q1.push(y);
			q1.push(x);
		}
		else if(x<y)
		{
			q2.push(x);
			q2.push(y);
		}
		m++;
		if(m>1e6) break;
	}
	if(q1.empty()) cout<<m<<" "<<2<<endl;
	else if(q2.empty()) cout<<m<<" 1\n";
	else cout<<-1<<endl;
	return 0;
}