#define _USE_MATH_DEFINES

#include <iostream>		//cin, cout
#include <vector>		//vector
#include <algorithm>	//sort,min,max,count
#include <string>		//string,getline, to_string
#include <cstdlib>		//abs(int)
#include <utility>		//swap, pair
#include <tuple>        //tuple
#include <deque>		//deque
#include <climits>		//INT_MAX
#include <bitset>		//bitset
#include <cmath>		//sqrt, ceil. M_PI, pow, sin
#include <ios>			//fixed
#include <iomanip>		//setprecision
#include <sstream>		//stringstream
#include <numeric>		//gcd, assumlate
#include <random>		//randam_device
#include <limits>		//numeric_limits

using namespace std;
constexpr long long int D_MOD = 1000000007;

int main() {

	int N, M;
	cin >> N >> M;

	vector<vector<int>> A(N);
	vector<vector<bool>> B(N, vector<bool>(N));

	int temp1, temp2;

	for (int i = 0; i < N; i++) {
		cin >> temp1;
		A.at(temp1 - 1).push_back(i + 1);
	}

	sort(A.rbegin(), A.rend());

	for (int i = 0; i < M; i++) {
		cin >> temp1 >> temp2;
		B.at(temp1 - 1).at(temp2 - 1) = true;
	}

	int ans = 0;

	for (int i = 0; i < N; i++) {
		if (A.at(i).size() == 1) {
			continue;
		}
		else if (A.at(i).size() == 0) {
			break;
		}
		else {
			ans += A.at(i).size() - 1;
			for (unsigned int j = 0; j < A.at(i).size() - 1; j++) {
				for (unsigned int k = j + 1; k < A.at(i).size(); k++) {
					if (B.at(A.at(i).at(j) - 1).at(A.at(i).at(k) - 1) == true) {
						ans--;
					}
				}
			}
		}
	}

	cout << ans << endl;

	return 0;

}