#include <bits/stdc++.h>
using namespace std;

#define InTheNameOfGod cin.tie(0); ios::sync_with_stdio(0);
#define inv pair<int, int>

void print(vector<int> &s)
{
    for(auto &x : s)
        cout << x << " ";
    cout << "\n";
}

void print(vector<inv> &s)
{
    for(auto &x : s)
        cout << x.first << ":" << x.second << " ";
    cout << "\n";
}

int main()
{
    InTheNameOfGod

    int n, k, c = 0;
    cin >> n >> k;

    vector<int> s(n+2);
    for(int i = 1; i <= n; i++)
    {
        cin >> s[i];
    }

    vector<inv> ss;
    ss.reserve(k);
    queue<inv> done;
    for(int i = 0, a, b; i < k; i++)
    {
        cin >> a >> b;
        ss.push_back({a, b});
    }

    sort(ss.begin(), ss.end());

    inv z(-1, -1);
    for(inv &x : ss)
    {
        if(x.first <= z.second)
        {
            z.second = max(z.second, x.second);
            continue;
        }

        done.push(z);
        z.first = x.first;
        z.second = x.second;
    }
    done.push(z);
    done.pop();

    while(!done.empty())
    {
        z = done.front();
        done.pop();
        sort(s.begin()+z.first, s.begin()+z.second+1);
    }

    for(int i = 1; i <= n; i++)
    {
        c = i == s[i] ? c+1 : c;
    }
    cout << c << "\n";

    return 0;
}