#include <bits/stdc++.h>
using namespace std;
int d,n,m,i,j,cur,r,a[1010],f[1010],st[1010],en[1010],k[1010];
pair<int,int> b[1010];
bool cmp(int i, int j) { return b[i]<b[j]; }
int main() {
  scanf("%d%d%d",&d,&n,&m);
  for (i=1; i<=n; i++) scanf("%d",&a[i]);
  sort(a+1,a+n+1);
  for (i=1; i<=m; i++) {
    scanf("%d%d",&b[i].second,&b[i].first);
    for (j=1; j<=n; j++) {
      if (st[i]==0 && a[j]>=b[i].second) st[i]=j;
      if (a[j]>b[i].first) break;
      en[i]=j;
    }
    if (st[i]==0) st[i]=en[i]+1;
    k[i]=i;
  }
  sort(k,k+m+1,cmp);
  r=1000000000;
  for (i=1; i<=m; i++) {
    f[i]=1000000000;
    cur=st[k[i]]-1;
    for (j=0; j<i; j++) if (en[k[j]]==cur && b[k[j]].first<b[k[i]].second) f[i]=min(f[i],f[j]+1);
    if (en[k[i]]==n) r=min(r,f[i]);
  }
  printf("%d\n",r);
  return 0;
}