//
#include<bits/stdc++.h>
using namespace std;
struct harl
{
	int l,r,id,p;
} a1[100010],a2[100010];
struct harll
{
	int num,x;
} b1[100010],b2[100010];
bool cmp(harl x,harl y)
{
	return x.l<y.l;
}
bool cmp2(harl x,harl y)
{
	return x.id<y.id;
}
int n,ans1=0,ans2=0,m1,m2,s1[100010],s2[100010];
int main()
{
	cin>>n>>m1>>m2;
	for(int i=0;i<m1;i++) 
	{
		cin>>a1[i].l>>a1[i].r;
		a1[i].id=i;
	}
	for(int i=0;i<m2;i++) 
	{
		cin>>a2[i].l>>a2[i].r;
		a2[i].id=i;
	}
	sort(a1,a1+m1,cmp);
	sort(a2,a2+m2,cmp);
	for(int i=0;i<m1;i++)
	{
		for(int j=0;j<m1;j++)
		{
			if(b1[j].x<a1[i].l&&b1[j].x!=0)
			{
				b1[j].x=a1[i].r;
				a1[i].p=j+1;
				b1[j].num++;
				break;
			}
			if(b1[j].x==0)
			{
				ans1++;
				b1[j].x=a1[i].r;
				a1[i].p=j+1;
				b1[j].num++;
				break;
			}
		}
	}
	for(int i=0;i<m2;i++)
	{
		for(int j=0;j<m2;j++)
		{
			if(b2[j].x<a2[i].l&&b2[j].x!=0)
			{
				b2[j].x=a2[i].r;
				a2[i].p=j+1;
				b2[j].num++;
				break;
			}
			if(b2[j].x==0)
			{
				ans2++;
				b2[j].x=a2[i].r;
				a2[i].p=j+1;
				b2[j].num++;
				break;
			}
		}
	}
	if(n>=ans1+ans2) 
	{
		cout<<m1+m2<<endl;
		return 0;
	}
	else
	{
		int anss=0;
		s1[0]=0;
		for(int i=1;i<=ans1;i++)
		{
			s1[i]+=(s1[i-1]+b1[i-1].num);
		}
		s2[0]=0;
		for(int i=1;i<=ans2;i++)
		{
			s2[i]+=(s2[i-1]+b2[i-1].num);
		}
		for(int i=1;i<=ans1;i++)
		{
			int j=min(n-i,ans2);
			anss=max(anss,s1[i]+s2[j]);
		}
		cout<<anss;
	}
	return 0;
}