#include <cstdio>
#include <stack>

using namespace std;

#define MAXN 1000000
#define MAXK 100000
#define NONE -1

int N,K;
int purrsons[MAXN];
bool seat[MAXN];

bool personSeated[MAXK+2];

void init()
{
	scanf("%d %d", &N, &K);
	int a;
	for(int i=0; i<K; i++)
	{
		scanf("%d", &a);
		seat[a-1]=true;
	}
	for(int i=0; i<=K; i++)
	{
		scanf("%d", &a);
		purrsons[a-1] = i+1;
		//printf("%d %d\n", a-1, i+1);
	}
}

void solve()
{
	stack<int> cur;
	
	int winner=NONE;
	int winningSeat=NONE;
	for(int i=0; i<N and winningSeat==NONE; i++) if(seat[i]) winningSeat=i;
	
	for(int i=0; i<N; i++)
	{
		if(purrsons[i]) { cur.push(i); }
		if(seat[i] and !cur.empty())
		{
			if(i == winningSeat) winner = purrsons[cur.top()];
			purrsons[cur.top()] = 0;
			cur.pop();
			seat[i]=false;
		}
	}
	for(int i=0; i<N; i++)
	{
		if(seat[i] and !cur.empty())
		{
			if(i == winningSeat) winner = purrsons[cur.top()];
			purrsons[cur.top()] = 0;
			cur.pop();
			seat[i]=false;
		}
	}
	printf("%d\n", winner);
	printf("%d\n", purrsons[cur.top()]); //the one left unseated
}

int main()
{
	freopen("birthday.in", "r", stdin);
	freopen("birthday.out", "w", stdout);
	
	init();
	solve();
	
	return 0;
}