#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<int, int>> A(M);
    for (size_t i = 0; i < M; i++)
    {
        cin >> a >> b;
        a--; b--;
        A[i] = {a, b};
    }
    bool f = true;

    while (f) {
        f = false;
        for (pair<int, int> i : A)
        {
            if (!is_sorted(S.begin() + i.first, S.begin() + i.second + 1)) {
                sort(S.begin() + i.first, S.begin() + i.second + 1);
                f = true;
            }
        }
    }
    int counter = 0;
    for (size_t i = 0; i < S.size(); i++)
    {
        if (S[i] == i + 1) counter++;
    }
    cout << counter;
}