#include <iostream>
#include <vector>
using namespace std;

unsigned long long n, k;
vector<unsigned long long> chairPos;
vector<unsigned long long> pos;
unsigned long long posOfPersonStandUp = -1;

unsigned long long findSolution()
{
	for (unsigned long long i = 0; i < pos.size(); i++)
	{
		if (pos[i] >= n)
			pos[i] = chairPos[0];

		if (pos[i] == chairPos[0])
		{
			for (unsigned long long z = 0; z < k + 1; z++)
			{
				bool found = false;
				for (unsigned long long y = 0; y < k; y++)
				{
					if (pos[z] != chairPos[y])
					{
						posOfPersonStandUp = z + 1;
						found = true;
						break;
					}
				}

				if (found) break;
			}

			return i;
		}
	}

	for (unsigned long long i = 0; i < k + 1; i++)
	{
		bool isMatch = false;
		for (unsigned long long j = 0; j < k; j++)
		{
			if (pos[i] == chairPos[j])
			{
				isMatch = true;
				break;
			}

			if (!isMatch)
				pos[i]++;
		}
	}

	findSolution();
}

int main()
{
	cin >> n >> k;

	for (unsigned long long i = 0; i < k; i++)
	{
		unsigned long long x; cin >> x;
		chairPos.push_back(x);
	}

	for (unsigned long long i = 0; i < k + 1; i++)
	{
		unsigned long long x; cin >> x;
		pos.push_back(x);
	}

	cout << findSolution() << endl;
	cout << posOfPersonStandUp << endl;

	return 0;
}