#include<cstdio>
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cmath>
#include<queue>
#include<vector>
#include<map>
using namespace std;
int m,n,k,ans=0;
int len[1005],b[1005],l[1005],r[1005];
int main()
{
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	cin>>len[i];
	for(int i=1;i<=m;i++)
	cin>>l[i]>>r[i];
	for(int i=1;i<=m;i++)
	{
		if(b[i]==0&&len[i]>=l[i]&&len[i]<=r[i])
			b[i]=1;
	}
	for(int i=1;i<=n;i++)
	if(b[i]==1)ans++;
	cout<<ans<<endl;
}