#include<fstream>
#include<algorithm>
using namespace std;

ifstream fin("fabrica.in");
ofstream fout("fabrica.out");

int n, nra, nrb;
int a[50001], b[50001];

void read();
void solve();

int main()
{
	read();
	solve();
	return 0;
}

void read()
{
	fin >> n;
	fin >> nra >> nrb;
	
	for(int i = 1; i <= nra; ++i)
		fin >> a[i];
	
	for(int i = 1; i <= nrb; ++i)
		fin >> b[i];
	
	fin.close();
}

void solve()
{
	nth_element(a+1, a+1, a+nra+1);
	
	int nr = 1;
	for(int i = 2; i <= n; ++i)
	{
		nth_element(a+1, a+i, a+nra+1);
		if( a[1] == a[i] )
			++nr;
	}
	
	int c = 0;
	while( n > 0)
	{
		++c;
		n = n - nr;
	}
	fout << c;
	fout.close();
}