#include<stdio.h>
#include<iostream>
#include<algorithm>
#include<queue>
#include<vector>
#define maxn 100000
using namespace std;
int n,m,res;
priority_queue<int,vector<int>,greater<int> > q;
struct  node{
	int x,y;
	bool line;
}ns[2*maxn+1000];
bool cmp(node a,node b){
	return a.x==b.x ? (!a.line):a.x<b.x;
}
void read(){
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++){
		int x;
		scanf("%d",&x);
		ns[i].x=x;ns[i].line=false;
	}
	for(int i=n+1;i<=m+n;i++){
		int x,y;
		scanf("%d %d",&x,&y);
		ns[i].x=x;ns[i].y=y;
		ns[i].line=true;
	}
	sort(ns+1,ns+n+m+1,cmp);
}
int solve(){
	for(int i=1;i<=m+n;i++){
		if(ns[i].line){q.push(ns[i].y);}
		else{
			while((!q.empty())&&ns[i].x>q.top())	q.pop();
			if(!q.empty()){res++;q.pop();}
		}
	}
	return res;
}
int main(){
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	read();
	printf("%d",solve());
	return 0;
}