#include<cstring>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<vector>
#include<queue>
using namespace std;
int n,m,a[100005],k=1,ans;
struct gm
{
	int begin;
	int last;
} g[100005];
bool cmp(gm x,gm y)
{
	return x.begin<y.begin||((x.begin==y.begin)&&(x.last<y.last));
}
int main()
{
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	   cin>>a[i];
	for(int j=1;j<=m;j++)
	   cin>>g[j].begin>>g[j].last;
	sort(a+1,a+1+n);
	sort(g+1,g+m+1,cmp);
	int i=1;
	while(i<=n&&k<=m)
	{
		if(g[k].begin<=a[i]&&g[k].last>=a[i])
		{   
		    i++;
		    ans++;
		}
		if(a[i]<g[k].begin) i++;
		k++;
	}
	cout<<ans;
}