#include <iostream>
#include <cstring>
#include <ctime>
#include <algorithm>
#include <cmath>
#include <vector>
#include <queue>
#include <set>
using namespace std;
typedef long long int ll;
const int N=4e6+9,INF=1e9;
const double eps=1e-5;
typedef pair <int,int> PII;
inline int read()
{
    int x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
inline ll readll()
{
    ll x=0,f=1;char c=getchar();
    while(c<'0' || c>'9') {if(c=='-') f=-1;c=getchar();}
    while(c>='0' && c<='9') {x=x*10+c-48,c=getchar();}
    return x*f;
}
struct node{
    int l,r,id;
    bool operator < (const node &b) const{
        return r>b.r;
    }
} p1[N],p2[N];
int n,m1,m2,c1[N],c2[N],ans;
priority_queue <node> q;
priority_queue <int,vector<int>,greater<int>> p;
bool cmpp(node x,node y)
{
    return x.l<y.l;
}
int main()
{
    #ifdef FILEIO
        freopen("airport.in","r",stdin);
        freopen("airport.out","w",stdout);
    #endif
    n=read(),m1=read(),m2=read();
    for(int i=1;i<=m1;i++) p1[i].l=read(),p1[i].r=read();
    for(int i=1;i<=m2;i++) p2[i].l=read(),p2[i].r=read();
    sort(p1+1,p1+m1+1,cmpp),sort(p2+1,p2+m2+1,cmpp);
    int cnt=0;
    for(int i=1;i<=m1;i++) p.push(i);
    for(int i=1;i<=m1;i++)
    {
        while(q.empty()==false && q.top().r<=p1[i].l)
        {
            p.push(q.top().id);
            q.pop();
        }
        p1[i].id=p.top(),q.push(p1[i]),p.pop();
    }
    while(q.empty()==false) q.pop();
    while(p.empty()==false) p.pop();
    cnt=0;
    for(int i=1;i<=m2;i++) p.push(i);
    for(int i=1;i<=m2;i++)
    {
        while(q.empty()==false && q.top().r<=p2[i].l)
        {
            p.push(q.top().id);
            q.pop();
        }
        p2[i].id=p.top(),q.push(p2[i]),p.pop();
    }
    for(int i=1;i<=m1;i++) c1[p1[i].id]++;
    for(int i=1;i<=m2;i++) c2[p2[i].id]++;
    for(int i=1;i<=n;i++) c1[i]+=c1[i-1],c2[i]+=c2[i-1];
    for(int i=0;i<=n;i++) ans=max(ans,c1[i]+c2[n-i]);
    printf("%d\n",ans);
    cerr<<endl<<1e3*clock()/CLOCKS_PER_SEC<<"ms";
    return 0;
}