#include<bits/stdc++.h>

using namespace std;
typedef long long ll;

#define FAST ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define mp make_pair
#define pb push_back
#define lp(i,s,f) for(ll i = s; i < ll(f); i++)
#define inF freopen("input.in", "r", stdin);
#define outF freopen("output.in", "w", stdout);
#define endl '\n'
#define MOD 1000000007
#define mm(arr) memset(arr, 0, sizeof(arr))
#define F first
#define S second

const int H = 2e5 + 5;
int main(){
    FAST
    int t = 1;
    while(t--){
        int n, m;
        cin >> n >> m;
        vector<int> h(n);
        for(int i = 0; i < n; i++){
            cin >> h[i];
        }
        sort(h.begin(), h.end());
        long long ans = 0;
        bool cant[H];
        mm(cant);
        for(int i = 0; i < m; i++){
            int a, b;
            cin >> a >> b;
            cant[b] = 1;
        }
        for(int i = 1; i < H; i++){
            if(cant[i]){
                continue;
            }
            ans += n - (lower_bound(h.begin(), h.end(), i) - h.begin());
        }
        cout << ans;
    }
    return 0;
}