#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAXN 100001
using namespace std;
int n,m,pre,ans,num[MAXN],vis[MAXN];
struct nond{
	int l,r;
}v[MAXN];
int cmp(nond a,nond b){
	return a.r<b.r;
}
int main(){
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)	scanf("%d",&num[i]);
	for(int i=1;i<=m;i++)	scanf("%d%d",&v[i].l,&v[i].r);
	sort(num+1,num+1+n);
	sort(v+1,v+1+m,cmp);
	for(int i=1;i<=n;i++)
		for(int j=pre+1;j<=m;j++)
			if(v[j].l<=num[i]&&v[j].r>=num[i]&&!vis[j]){
				pre=j;vis[j]=1;
				ans++;break;
			}
	cout<<ans;
}