#prag\
ma GCC optimize("O3")
#include<cstdio>
#include<cctype>
#include<algorithm>
#define loop(i,j,k) for(int i=j;i<=k;i++)
#define smax(a,b) a>b?a:b
using namespace std;
inline void in(int &x){
    x=0;int f=1;char c=getchar();
    while(!isdigit(c)){if(!(c-'-'))f=-1;c=getchar();}
    while (isdigit(c))x=(x<<3)+(x<<1)+(c^48),c=getchar();
    x*=f;
}
inline void out(int x){
    if(!x){putchar('0');return;}
    if(x<0)x=~x+1,putchar('-');
    char c[30]={0};
    while(x)c[++c[0]]=x%10+48,x/=10;
    while(c[0])putchar(c[c[0]--]);
}
const int maxn=100001;
int n,m;
int a[maxn],ans=0;
struct line{
	int l,r;
}b[maxn];
bool used[maxn];
inline bool cmp(line a,line b){
	return a.l==b.l ? a.r<b.r : a.l<b.l;
}
inline int poi(){
	freopen("bg.in","r",stdin);
	freopen("bg.out","w",stdout);
	in(n);in(m);
	loop(i,1,n) in(a[i]);
	loop(i,1,m) in(b[i].l),in(b[i].r);
	sort(a+1,a+n+1);
	sort(b+1,b+m+1,cmp);
	loop(i,1,n){
		loop(j,1,m){
			if((!used[j])&&a[i]<=b[j].r&&a[i]>=b[j].l){
				used[j]=1;ans++;break;
			}
		}
	}
	out(ans);
}
int yuudachi=poi();
int main(){;}