#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

typedef pair<int,int> PII;

int main(){
    int d,n,m;

    cin>>d>>n>>m;
    vector<int> days(n);
    for(int i=0;i<n;++i) cin>>days[i];
    sort(days.begin(),days.end());

    vector<PII> l(m);
    for(int i=0;i<m;++i) cin>>l[i].first>>l[i].second;

    sort(l.begin(),l.end());

    int used=0;
    int cnt=0;
    int last=-1;


    for(int i=0;i<n;++i){
        if(last>=days[i]) ;
        else{
            while(days[i]>l[cnt].second) ++cnt;
           
            last=l[cnt].second;
            ++cnt; ++used;
 
            while(cnt<m-1 && l[cnt+1].first<=days[i]){ 
                last=max(last,l[cnt+1].second); 
                ++cnt; 
            }
        }
    }

    cout<<used<<'\n';

}