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

int main() {
    int n, m;
    cin >> n >> m;
    
    vector<int> szamok;
    
    for (int i = 0; n > i; i++) {
        int temp;
        cin >> temp;
        
        szamok.push_back(temp);
    }
    
    vector<pair<int, int>> inter;
    
    for (int i = 0; m > i; i++) {
        int a, b;
        cin >> a >> b;
        
        a--;
        b--;
        
        inter.push_back({a, b});
    }
    
    sort(inter.begin(), inter.end());
    
    vector<pair<int, int>> realInter;
    
    int currentStart = -1;
    int currentEnd = -1;
    
    for (int i = 0; m > i; i++) {
        pair<int, int> current = inter[i];
        
        if (currentStart == -1) {
            currentStart = current.first;
            currentEnd = current.second;
        } else if (currentEnd >= current.first) {
            // Ez egybeesik
            currentEnd = current.second;
        } else {
            realInter.push_back({currentStart, currentEnd});
            
            currentStart = current.first;
            currentEnd = current.second;
        }
    }
    
    if (currentStart != -1) {
        realInter.push_back({currentStart, currentEnd});
    }
    
    int megoldas = 0;
    
    for (auto curr : realInter) {
        int start = curr.first;
        int end = curr.second;
        
        vector<int> subInter;
        
        for (int i = start; end >= i; i++) {
            subInter.push_back(szamok[i]);
        }
        
        sort(subInter.begin(), subInter.end());
        
        for (int i = 0; subInter.size() > i; i++) {
            if (subInter[i] == start+i+1) {
                megoldas++;
            }
        }
    }
    
    int lastIndex = 0;
    for (auto curr : realInter) {
        for (int i = lastIndex; n > i && curr.first > i; i++) {
            if (i+1 == szamok[i]) {
                megoldas++;
            }
        }
        
        lastIndex = curr.second+1;
    }
    
    cout << megoldas << endl;
    
	return 0;
}