#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int len[100050];
int num_len[100050]={0};
struct Sh{
	int be;
	int en;
}sh[100050];
bool cmp(const Sh &x,const Sh &y){
	return x.be<y.be?1:0;
}
int main(){
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	int n,m;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	 cin>>len[i];
	for(int i=1;i<=m;i++){
	  cin>>sh[i].be>>sh[i].en;
	  for(int j=sh[i].be;j<=sh[i].en;j++)
	   num_len[j]++;
    }
    sort(len+1,len+n);
    sort(sh+1,sh+m,cmp);
    int jis=0;
    for(int i=1;i<=n;i++){
    	if(num_len[len[i]]!=0){
    	 for(int j=1;j<=m;j++){
    	 	if(sh[j].be<=len[i]&&sh[j].en>=len[i]){
    	 		for(int k=sh[j].be;k<=sh[j].en;k++){
    	 		 num_len[k]--;
			 }
			 jis++;
			 break;
			 }
		 }
		}
	}
	cout<<jis;
	return 0;
	fclose(stdin);
	fclose(stdout);
}