#include<cstdio>
#include<algorithm>
using namespace std;
struct q{
	int l;
	int r;
}a[100010];
int len[100010];
int n,m;
bool cmp(const q &a,const q &b){
	if(a.r<b.r)
		return true;
	else
		if(a.r>b.r)
			return false;
		else
			return a.l<b.l;
}
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",&len[i]);
	for(int i=1;i<=m;i++)
		scanf("%d%d",&a[i].l,&a[i].r);
	sort(len+1,len+n+1);
	sort(a+1,a+m+1,cmp);
	int k=1,i=1,sum=0;
	while(i<=n&&k<=m){
		if(len[i]>=a[k].l&&len[i]<=a[k].r){
			sum++;
			k++;
			i++;
		}
		else
			if(len[i]>a[k].r)
				k++;
			else
				i++;
	}
	printf("%d",sum);
}