#include<bits/stdc++.h>
using namespace std;
bool z[100001]={0};
int n,m,a[100001],b=1,ans=0;
struct node
{
    int a,c; 
}e[100001];
bool cmp(node x,node y)
{
    return x.c<y.c;
}
bool cmp1(int x,int y)
{
    return x<y;
}
int main()
{
    freopen("bg.in","r",stdin);
    freopen("bg.out","w",stdout);
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        cin>>a[i];
    sort(a+1,a+n+1,cmp1);  
    for(int i=1;i<=m;i++)
        cin>>e[i].a>>e[i].c;
    sort(e+1,e+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
        if(e[i].c>=a[b])
            for(int j=1;j<=n;j++)
                if(e[i].a<=a[j]&&e[i].c>=a[j]&&!z[j])
                {
                    ans++;
                    b++;
                    z[j]=1;
                    break;
                }
    }
    cout<<ans<<endl;
    return 0;
}