#include <bits/stdc++.h>

const int N = 100010;

int n;
int f[N], g[N];
int ini[N];
int pos[N];
std::pair<int, int> event[N * 2];

void calc(int m, int* arr) {
	std::priority_queue<int, std::vector<int>, std::greater<int>> que(ini + 1, ini + n + 1);
	memset(pos, 0, sizeof(pos));
	for (int i = 1; i <= m; ++i) {
		int l, r; std::cin >> l >> r;
		event[i * 2 - 1] = std::make_pair(l, i);
		event[i * 2] = std::make_pair(r, -i);
	}
	std::sort(event + 1, event + m * 2 + 1);
	for (int i = 1; i <= m * 2; ++i)
		if (event[i].second > 0) {
			if (!que.empty()) { ++arr[pos[event[i].second] = que.top()]; que.pop(); }
		} else {
			int x = pos[-event[i].second];
			if (x) que.push(x);
		}
	for (int i = 1; i <= n; ++i) arr[i] += arr[i - 1];
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(NULL); std::cout.tie(NULL);

	int m1, m2; std::cin >> n >> m1 >> m2;
	std::iota(ini + 1, ini + n + 1, 1);
	calc(m1, f); calc(m2, g);
	int ans = 0;
	for (int i = 0; i <= n; ++i) ans = std::max(ans, f[i] + g[n - i]);
	std::cout << ans << '\n';

	return 0;
}