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

int N, M;

int main() {
    cin >> N >> M;
    vector<int> S(N);
    for (size_t i = 0; i < N; i++)
    {
        cin >> S[i];
    }
    int a, b;
    vector<pair<bool, pair<int, int>>> A(M);
    {
    vector<vector<int>> B(N);
    for (size_t i = 0; i < M; i++)
    {
        cin >> a >> b;
        a--; b--;
        for (size_t k = a; k < b + 1; k++)
        {
            B[k].push_back(i);
        }
        A[i].second = {a, b};
    }
    for (size_t i = 0; i < N; i++)
    {
        if (B[i].size() > 1) {
            for (size_t k = 0; k < B[i].size(); k++)
            {
                A[B[i][k]].first = true;
            }
        }
    }
    }
    bool f = true;
    for (pair<bool, pair<int, int>> i : A)
    {
        sort(S.begin() + i.second.first, S.begin() + i.second.second + 1);
    }
    while (f) {
        f = false;
        for (pair<bool, pair<int, int>> i : A)
        {
            if (i.first && !is_sorted(S.begin() + i.second.first, S.begin() + i.second.second + 1)) {
                sort(S.begin() + i.second.first, S.begin() + i.second.second + 1);
                f = true;
            }
        }
    }
    int counter = 0;
    for (size_t i = 0; i < S.size(); i++)
    {
        if (S[i] == i + 1) counter++;
    }
    cout << counter;
}