#include <fstream>
#include <iomanip>
#include <cstdio>
#include <cstring>
#include <queue>
#include <cmath>
#include <algorithm>
#define MAX 100010
using namespace std;
class q
{
public:
	int l;
	int r;
}q[MAX];
bool d(int x,int y)
{
	return y>x;
}
bool vis[MAX];
int len[MAX],lenz[MAX];
int n,m,i,j,ans=0;//表示N条素材和M个审核员
int main()
{
	memset(vis,false,sizeof(vis));
	ifstream fin("bg.in");
	ofstream fout("bg.out");
	fin>>n>>m;
	for(i=1;i<=n;i++)
		fin>>len[i];
	for(i=1;i<=m;i++)
	{
		fin>>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;
	}
	fout<<ans<<endl;
	return 0;
}