#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<vector>
#include<queue>
using namespace std;
int n,m,ans,a[100010];
struct poi{
	int l,r;
}p[100010];
bool cmp(const poi&a,const poi&b){
	if(a.r<b.r)return 1;
    if(a.r>b.r)return 0;
    if(a.l<a.l)return 1;
    return 0;
}
int main(){
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
    int tot=1,tt=1;
	cin>>n>>m;
	for(int i=1;i<=n;i++)cin>>a[i];
	for(int i=1;i<=m;i++)cin>>p[i].l>>p[i].r;
	sort(a+1,a+1+n);
	sort(p+1,p+1+m,cmp);
	for(int i=1;i<=n;i++){
		while(p[tot].r<a[i]&&tot<n){
		tot++;
	    tt=tot; 
		 }
	    while(p[tot].l>a[i]&&tot<=n)tot++;
	   // cout<<tot<<' '<<tt<<endl;
        if(p[tot].l<=a[i]&&p[tot].r>=a[i])ans++;
        if(tt>n)break;
        tot=tt+1;tt++;
	}
//	for(int i=1;i<=m;i++)cout<<p[i].l<<' '<<p[i].r<<endl;
	cout<<ans;
	return 0;
}