#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int SC[100010];
struct admin
{
	int left;
	int right;
	bool c;
}ad[100010];
bool operator < (const admin &a,const admin &b)
{
	if(a.right<b.right)	return true;
	else return false;
}
int main()
{
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&SC[i]);
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d",&ad[i].left,&ad[i].right);
	}
	sort(ad+1,ad+m+1);
	sort(SC+1,SC+n+1);
	int ans=0;
	for(int i=n;i>=1;i--)
	{
		for(int j=m;j>=1;j--)
		{
			if(SC[i]<=ad[j].right && SC[i]>=ad[j].left && ad[j].c==false)
			{
				ad[j].c=true;
				ans++;
				m--;
				break;
			}
		}	
	}
	printf("%d",ans);
	return 0;
}