In BerSoft n programmers work, the programmer i is characterized by a skill r_i.

A programmer a can be a mentor of a programmer b if and only if the skill of the programmer a is strictly greater than the skill of the programmer b (r_a > r_b) and programmers a and b are not in a quarrel.

You are given the skills of each programmers and a list of k pairs of the programmers, which are in a quarrel (pairs are unordered). For each programmer i, find the number of programmers, for which the programmer i can be a mentor.

Input

The first line contains two integers n and k (2 ≤ n ≤ 2 ⋅ 10^5, 0 ≤ k ≤ min(2 ⋅ 10^5, (n ⋅ (n - 1))/(2))) — total number of programmers and number of pairs of programmers which are in a quarrel.

The second line contains a sequence of integers r_1, r_2, ..., r_n (1 ≤ r_i ≤ 10^{9}), where r_i equals to the skill of the i-th programmer.

Each of the following k lines contains two distinct integers x, y (1 ≤ x, y ≤ n, x ≠ y) — pair of programmers in a quarrel. The pairs are unordered, it means that if x is in a quarrel with y then y is in a quarrel with x. Guaranteed, that for each pair (x, y) there are no other pairs (x, y) and (y, x) in the input.

Output

Print n integers, the i-th number should be equal to the number of programmers, for which the i-th programmer can be a mentor. Programmers are numbered in the same order that their skills are given in the input.

Examples

Input

4 2
10 4 10 15
1 2
4 3


Output

0 0 1 2 


Input

10 4
5 4 1 5 4 3 7 1 2 5
4 6
2 1
10 8
3 5


Output

5 4 0 5 3 3 9 0 2 5 

Note

In the first example, the first programmer can not be mentor of any other (because only the second programmer has a skill, lower than first programmer skill, but they are in a quarrel). The second programmer can not be mentor of any other programmer, because his skill is minimal among others. The third programmer can be a mentor of the second programmer. The fourth programmer can be a mentor of the first and of the second programmers. He can not be a mentor of the third programmer, because they are in a quarrel.
import java.io.*;
import java.util.*;

public class Main{
    public static long mod = (long)1e9+7;
    public static ArrayList<Integer>[] graph;
    public static void main(String[] args) {
        InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
        int t = 1;
        // t = in.nextInt();
        for(int i = 1;i<=t ;i++){
            solve(in,out);
        }
        out.close();
    }

    private static void solve(InputReader in, PrintWriter out) {
        int n = in.nextInt();
        int m = in.nextInt();
        DSU dsu = new DSU(n);
        Pair<Integer,Integer>[] map = new Pair[n];
        int[] rank = new int[n];
        for (int i = 0; i < n; i++) {
            int r = in.nextInt();
            map[i] = new Pair(r,i);
            rank[i] = r;
        }
        Arrays.sort(map);
        int[] ans = new int[n];
        /*int prev = -1, count = 0;
        for (int i = 0; i < n; ++i) {
            if (prev == -1 || prev == map[i].first) ans[map[i].second] = count;
            else ans[map[i].second] = i;
            prev = map[i].first;
            count = ans[map[i].second];
        }*/
        
        for (int i = 0; i < n; i++) {
            if(i==0) ans[map[i].second] = 0;
            else if((int)map[i].first == (int)map[i-1].first) ans[map[i].second] = ans[map[i-1].second];
            else ans[map[i].second] = i;
        }
        for (int i = 0; i < m; i++) {
            int u = in.nextInt();
            int v = in.nextInt();
            --u;--v;
            if(rank[u] > rank[v]){
                ans[u]--;
            }
            else if(rank[v] >rank[u]) ans[v]--;
        }
        for(int l :ans) out.print(l+" ");
        out.println();
    }

    private static int less(Pair<Integer, Integer>[] map, Pair p) {
        if((int)map[0].first >= (int)p.first) return -1;
        int lo = 0;
        int hi = map.length-1;
        int val = (int)p.first;
        while(lo<hi){
            int mid = (hi+lo)/2;
            if((int)map[mid].first >= val){
                hi = mid;
            }
            else lo = mid+1;
        }
        return hi-1;

    }
}
class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;
 
    public InputReader(InputStream stream) {
        reader = new BufferedReader(new InputStreamReader(stream), 32768);
        tokenizer = null;
    }
 
    public String next() {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }
 
    public int nextInt() {
        return Integer.parseInt(next());
    }
 
    public long nextLong() {
        return Long.parseLong(next());
    }
    public double nextDouble(){
        return Double.parseDouble(next());
    }
    public int[] readIntArray(int size){
        int[] list = new int[size];
        for(int i = 0;i<size;i++) list[i] = nextInt();
        return list;
    }
    public long[] readLongArray(int size){
        long[] list = new long[size];
        for(int i = 0;i<size;i++) list[i] = nextLong();
        return list;
    }
    public double[] readDoubleArray(int size){
        double[] list = new double[size];
        for(int i = 0;i<size;i++) list[i] = nextDouble();
        return list;
    }
    public String linereader() {
        String s = null;
        try{
            s = reader.readLine();
        }
        catch (IOException e) {
            throw new RuntimeException(e);
        }
        return s;
    }
 
}
class Pair<T extends Comparable<T>,K extends Comparable<K> > implements Comparable<Pair<T,K>>{
    T first;
    K second;
    public Pair(T first, K second){
        this.first  = first;
        this.second = second;
    }
    @Override
    public String toString(){
        return first+" "+second;
    }
    @Override
    public int compareTo(Pair<T,K> o) {
        // TODO Auto-generated method stub
        if((first).compareTo(o.first)!=0) return first.compareTo(o.first);
        else return second.compareTo(o.second);
    }

}
class DSU {
    private int[] rank;
    private int[] parent;
    private int numSets;
    private int[] sizeOfSets; 
    public DSU(int n){
        rank = new int[n];
        parent = new int[n];
        numSets = n;
        sizeOfSets = new int[n];
        for(int i = 0;i<n;i++) {
            parent[i] = i;
            sizeOfSets[i] = 1;
        }
    }
    public int findSet(int k){
        if(parent[k]==k) return k;
        else return parent[k] = findSet(parent[k]);
    }
    public boolean isSameSet(int i, int j){
        return findSet(i)==findSet(j);
    }
    public void unionSet(int i, int j){
        if(!(isSameSet(i, j))){
            int x = findSet(i);
            int y = findSet(j);
            numSets--;
            if(rank[x]>rank[y]){
                parent[y] = x;
                sizeOfSets[x]+=sizeOfSets[y];
            }
            else{
                parent[x] = y;
                sizeOfSets[y]+=sizeOfSets[x];
                if(rank[x]==rank[y]) rank[y]++;
            }
        }
    }
    public int numOfComponents(){
        return numSets;
    }
    public int sizeOfSet(int k){
        return sizeOfSets[findSet(k)];
    }

}
