#include <iostream>
#include <algorithm>

#define NMAX 1007

using namespace std;

int n, m, a[NMAX], Ap[NMAX], d, Count[NMAX], A[NMAX], B[NMAX], Ans;

int main(){
    cin >> d >> n >> m;
    for(int i = 1; i <= n; ++i)
        cin >> a[i];
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= m; ++i){
        cin >> A[i] >> B[i];
        for(int j = 1; j <= n; ++j)
            if(A[i] <= a[j] && a[j] <= B[i])
                Count[i]++;
    }
    for(int i = 1; i <= n; ++i)
        if(Ap[i] == 0){
            ++Ans;
            int Max = 0, poz = 0;
            for(int j = 1; j <= m; ++j)
                if(A[j] <= a[i] && a[i] <= B[j]){
                    Max = max(Max, Count[j]);
                    if(Max == Count[j])
                        poz = j;
                }
            if(poz != 0)
                for(int i = 1; i <= n; ++i)
                    if(A[poz] <= a[i] && a[i] <= B[poz])
                        Ap[i] = 1;
        }
    cout << Ans;
    return 0;
}