#include<iostream>
#include<cstdio>
#include<algorithm>

using namespace std;

int n,m,pb[100010],ans;

struct nodes
{
	int l,r;
	bool operator < (const nodes & b) const
	{
		if(l!=b.l) return l<b.l;
		else return r<b.r;
	}
}pe[100010];

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",&pb[i]);
	for(int i=1;i<=m;i++) scanf("%d%d",&pe[i].l,&pe[i].r);
	sort(pb+1,pb+n+1);
	sort(pe+1,pe+m+1);
	int a=1,b=1;
	while(a<=n&&b<=m){
		if(pb[a]>pe[b].r) b++;
		if(pb[a]<pe[b].l) a++;
		if(pb[a]<=pe[b].r&&pb[a]>=pe[b].l){
			a++;
			b++;
			ans++;
		}
	}
	printf("%d",ans);
	return 0;
}