#include<cstdio>
#include<cmath>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<queue>
#define XLM
using namespace std;
const int maxn=100010;
priority_queue <int,vector<int>,greater<int> > que;
int val[maxn],n,m,ans;
pair<int,int> t[maxn];

int main(){
	#ifdef XLM
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	#endif
	scanf("%d%d",&n,&m);
	for (int i=1;i<=n;i++) scanf("%d",&val[i]);
	for (int i=1;i<=m;i++){
		scanf("%d%d",&t[i].first,&t[i].second);
	}
	sort(val+1,val+n+1);
	sort(t+1,t+m+1);
	int pos=1;
	for (int i=1;i<=n;i++){
		while (pos<=m && t[pos].first<=val[i]) 
			que.push(t[pos++].second);
		int v=0;
		do{
			if (que.empty()) break;
			v=que.top();
			que.pop();
		}while(v<val[i]);
		if (v>=val[i]) ans++;
	}
	printf("%d",ans);
}