#include<bits/stdc++.h>
using namespace std;
int mmax=0;
int n,m;
long long len[100001];
struct lev
{
    int minn;
    int maxx;
    int y=0;
}lev[100001];
void dfs(int flag,int sum)
{
    sum++;
    for(int i=1;i<=m;i++)
    {
        //cout<<"********"<<len[flag]<<endl; 
        if(lev[i].y ==0)//还没有查;
        {
            if((len[flag]>lev[i].minn ||len[flag]==lev[i].minn)&&(len[flag]<lev[i].maxx  ||len[flag]==lev[i].maxx))
             {
                 lev[i].y =1;
                 //cout<<"mmax="<<mmax<<"  len[flag]="<<len[flag]<<"  i="<<i<<endl;
                 mmax++;
                 flag++;
                 dfs(flag,sum);
             }
         } 
    }
    //cout<<sum<<endl;
    if(sum<n)
    dfs(flag+1,sum);
    else
    return ;
}
int main()
{
    freopen("bg.in","r",stdin);
    freopen("bg.out","w",stdout);
    
    cin>>n>>m;
    for(int i=1;i<=n;i++)
    cin>>len[i];
    
    for(int i=1;i<=m;i++)
    cin>>lev[i].minn >>lev[i].maxx ; 
    
    dfs(1,0);
    
    cout<<mmax<<endl;
    return 0;
}