#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 10;
int n, m1, m2;
long long s1[N], s2[N]; // 类别 
struct fl {
	int a, b, id;
	bool operator < (const fl &x) const {
		return b >= x.b;
	} 
}dom[N], inter[N];
int main() {
	cin >> n >> m1 >> m2;
	for (int i = 1; i <= m1; i++) {
		cin >> dom[i].a >> dom[i].b;
	}
	for (int i = 1; i <= m2; i++) {
		cin >> inter[i].a >> inter[i].b;
	}
	priority_queue<fl> q1, q2;
	int cnt1 = 1;
	dom[1].id = 1;
	q1.push(dom[1]);
	s1[dom[1].id]++;
	for (int i = 2; i <= m1; i++) {
		auto t = q1.top();
		if (t.b <= dom[i].a) {
			q1.pop();
			dom[i].id = t.id;
		} else {
			dom[i].id = ++cnt1;
		}
		s1[dom[i].id]++;
		q1.push(dom[i]);
	}
	int cnt2 = 1;
	inter[1].id = 1;
	q2.push(inter[1]);
	s2[inter[1].id]++;
	for (int i = 2; i <= m2; i++) {
		auto t = q2.top();
		if (t.b <= inter[i].a) {
			q2.pop();
			inter[i].id = t.id;
		} else {
			inter[i].id = ++cnt2;
		}
		s2[inter[i].id]++;
		q2.push(inter[i]);
	}
	for (int i = 2; i <= n; i++) {
		s1[i] += s1[i - 1];
	}
	for (int i = 2; i <= n; i++) {
		s2[i] += s2[i - 1];
	}
	long long ans = -1e9;
	for (int i = 0; i <= n; i++) {
		ans = max(ans, s1[i] + s2[n - i]);
	}
	cout << ans;
	return 0;
}