#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=100000+10;
struct T{
	int l,r;
	bool operator<(const T &a)const{
		if(l!=a.l)
			return r>a.r;
		return l<a.l;
	}
}A[maxn];
int B[maxn];
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",&B[i]);
	for(int i=1;i<=m;i++)
		scanf("%d %d",&A[i].l,&A[i].r);
	int now=1;
	int ans=0;
	for(int i=1;i<=n;i++){
		while(A[now].r<B[i])
			now++;
		if(A[now].l>B[i])
			continue;
		ans++;
	}
	printf("%d\n",ans);
return 0;
}