#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
LL ans[200005];
int n,pos,brr[200005];
struct nd{
    int num,id;
    nd(int _num=0,int _id=0){num=_num;id=_id;}
    bool operator<(const nd& a) const{
        return num==a.num?id<a.id:num<a.num;
    }
}arr[200005];
int main(){
    int m,x,y;
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;++i){scanf("%d",&arr[i].num);brr[i]=arr[i].num;arr[i].id=i;}
    sort(arr+1,arr+1+n);
    for (int i=1;i<=n;++i){ans[i]=lower_bound(arr+1,arr+1+n,nd(brr[i],0))-arr-1;}
    ++m;while (--m){
        scanf("%d%d",&x,&y);
        if (brr[x]>brr[y]){--ans[x];}
        if (brr[x]<brr[y]){--ans[y];}
    }
    for (int i=1;i<=n;++i){printf("%lld%c",ans[i]," \n"[i==n]);}
    return 0;
}