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

int n,m,a[200005],b[200005];
int f[200005];

int main(){
	ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	
	cin >> n >> m;
	for(int i = 1; i <= n; i++)
		cin >> a[i], b[i] = a[i];
	while(m--){
		int x,y;
		cin >> x >> y;
		
		if(a[x] < a[y])
			f[y]++;
		else if(a[x] > a[y])
			f[x]++;
	}
	
	sort(b+1,b+n+1);
	
	for(int i = 1; i <= n; i++){
		int it = lower_bound(b+1,b+n+1,a[i]) - b - 1;
		
		cout << it - f[i] << ' ';
	}
	
	return 0;
}