#include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <cctype>
#include <set>
#include <map>
using namespace std;
#define MAXN (100005)

//#define dbg

void set_file()
{
	freopen("bg.in", "r", stdin);
	freopen("bg.out", "w", stdout);
}

//-------------------------------------------------------------

struct admin
{
	int left;
	int right;
};

int n,m;
int len[MAXN];
admin adm[MAXN];

void read()
{
	int i;
	cin >> n >> m;
	for(i = 1; i <= n; i++)
		scanf("%d", len+i);
	for(i = 1; i <= m; i++)
		scanf("%d %d", &adm[i].left, &adm[i].right);
}

inline bool ac(admin &ad, int que)
{
	return (len[que] <= ad.right && len[que] >= ad.left);
}

/*
int dp[MAXN];
*/
int nt[MAXN];

void solve()
{
	
	int i,j,k,s = -1;
	
	//展现机智的时刻到了 
	for(i = 1; i <= n; i++)
	{
		for(j = 1; j <= m; j++)
		{
			if(ac(adm[j],i))
			{
				nt[j]++;					
			}
		}
	}
	s = 0;
	for(i = 1; i <= m; i++)
	{
		if(nt[i] == 1)
			s++;
	}
	cout << s << endl;
}

int main()
{
#ifndef dbg
	set_file();
#endif
	
	read();
	solve();
	
	return 0;
}

/*
			if(ac(adm[j],i))
			{
				dp[i]++;
				
				for(k = 1; k < i; k++)
				{
					if(ac(adm[j],k)) 
						dp[i] = max(dp[i], dp[k]);
					else
						break;
				}
				s = max(s,dp[i]);  
*/     

     	/*
	for(i = 1; i <= n; i++)
	{
		for(j = 1; j <= m; j++)
		{
			if(ac(adm[j], i))
			{
				dp[i]++;		
				for(k = 1; k < i; k++)
					dp[i] = max(dp[i], dp[k]);
			}
			else;
				dp[i] = dp[i-1];
		} 
		s = max(s,dp[i]);
	}
	cout << s << endl;
	*/
//	map<int, int> st;