#include <iostream>
#include <algorithm>
#include <queue>
#define x first
#define y second
using namespace std;
const int N = 1e5 + 10;
typedef pair<int,int> PII;
int n,m1,m2;
PII a[N],b[N];
int main(){
	scanf("%d %d %d",&n,&m1,&m2);
	for(int i=1;i<=m1;i++) scanf("%d %d",&a[i].x,&a[i].y);
	for(int i=1;i<=m2;i++) scanf("%d %d",&b[i].x,&b[i].y);
	sort(a + 1,a + m1 + 1);
	sort(b + 1,b + m2 + 1);
	int ans = 0;
	for(int i=0;i<=n;i++){
		int j = n - i;
		priority_queue<PII,vector<PII>,greater<PII> > q1;
		priority_queue<PII,vector<PII>,greater<PII> > q2;
		int idx1 = min(i,m1),idx2 = min(j,m2);
		for(int k=1;k<=idx1;k++) q1.push(a[k]);
		for(int k=1;k<=idx2;k++) q2.push(b[k]);
		int cnt = idx1 + idx2;
		idx1++,idx2++;
		while(!q1.empty() && idx1 <= m1 && q1.size() <= i){
			PII t = q1.top();
			q1.pop();
			if(t.y <= a[idx1].x){
				cnt++;
				q1.push(a[idx1]);
			}
			idx1++;
		}
		while(!q2.empty() && idx2 <= m2 && q2.size() <= j){
			PII t = q2.top();
			q2.pop();
			if(t.y <= b[idx2].x){
				cnt++;
				q2.push(b[idx2]);
			}
			idx2++;
		}
		ans = max(ans,cnt);
	}
	printf("%d",ans);
	return 0;
}