#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cstring>
#include<queue>
#include<cmath>
#include<algorithm>
#define MAXN 100010
using namespace std;
struct q
{
	int l;
	int r;
}q[MAXN];
bool d(int x,int y)
{
return y>x;
}
bool vis[MAXN];
int len[MAXN],lenz[MAXN];
int n,m,i,j,ans=0;//表示N条素材和M个审核员
int main()
{
	memset(vis,false,sizeof(vis));
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	cin>>n>>m;
	for(i=1;i<=n;i++)cin>>len[i];
	for(i=1;i<=m;i++)
		{
	cin>>q[i].l>>q[i].r;
}
	for(i=1;i<=n;i++)
	{  
		for(j=1;j<=m;j++)
		if(len[i]<=q[j].r&&len[i]>=q[j].l&&!vis[j])
			{
				vis[j]=true;
				ans++;
			}
		else if(len[i]>q[j].r||len[i]<q[j].l)continue;
	}
	cout<<ans-1;
		return 0;
}