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

long n,i,j,v[1055],d[1055],nr,m,k,mx,stiva[1055];
struct ab{
    long st,dr;
}s[1054];

long comp(long a,long b)
{
    return a<b;
}

long comp2(ab a,ab b)
{
    if (a.st==b.st)
        return a.dr<b.dr;
    return a.st<b.st;
}

int main()
{
    cin>>n>>m>>k;
    for (i=1;i<=m;i++)
        cin>>v[i];
    for (i=1;i<=k;i++)
        cin>>s[i].st>>s[i].dr;

    sort (v+1,v+m+1,comp);
    sort (s+1,s+k+1,comp2);

    nr=0;
    j=1;
    for (i=1;i<=k;)
    {
        while (s[i].st<mx && i<=k)
            i++;
        while (s[i].st<=v[j] && i<=k)
        {
            if (s[i].dr>mx)
                mx=s[i].dr;
            i++;
        }
        while (v[j]<=mx && j<=m)
            j++;
        nr++;
        if (j>m)
            break;
    }
    cout<<nr;
    return 0;
}