#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int inside[100005][2]={0},outside[100005][2]={0},sum1[100005],sum2[100005];
struct edge
{
	int in,out;
	bool bok;
}plane1[100005],plane2[100005];
bool cmp(struct edge A,struct edge B)
{
	if(A.in<B.in)
	 return true;
	return false;
}
int main()
{
	ios::sync_with_stdio(false);
	int n,m1,m2,i,sum=0,j;
	cin>>n>>m1>>m2;
	for(i=0;i<=m1-1;i++)
	 cin>>plane1[i].in>>plane1[i].out,plane1[i].bok=false;
	for(i=0;i<=m2-1;i++)
	 cin>>plane2[i].in>>plane2[i].out,plane2[i].bok=false;
	sort(plane1,plane1+m1,cmp);
	sort(plane2,plane2+m2,cmp);
	inside[0][1]=outside[0][1]=0;
	for(i=0;i<=m1-1;i++)
	{
		j=1;
		while(inside[j][0]>plane1[i].in)
		 j++;
		inside[j][0]=plane1[i].out,inside[j][1]++;
	}
	for(i=0;i<=m2-1;i++)
	{
		j=1;
		while(outside[j][0]>plane2[i].in)
		 j++;
		outside[j][0]=plane2[i].out,outside[j][1]++;
	}
	for(i=1;i<=n;i++)
	 inside[i][1]=inside[i-1][1]+inside[i][1];
	for(i=1;i<=n;i++)
	 outside[i][1]=outside[i-1][1]+outside[i][1];
	for(i=0;i<=n;i++)
	 sum=max(sum,inside[i][1]+outside[n-i][1]);
	cout<<sum<<endl;
	return 0;
}