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.util.*;
// import java.lang.*;
import java.io.*;

//           THIS TEMPLATE MADE BY AKSH BANSAL.

public class Solution {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
    private static boolean[] isPrime;
    private static void primes(){
        int num = (int)1e6; // PRIMES FROM 1 TO NUM
        isPrime = new boolean[num];
     
        for (int i = 2; i< isPrime.length; i++) {
           isPrime[i] = true;
        }
        for (int i = 2; i< Math.sqrt(num); i++) {
           if(isPrime[i] == true) {
              for(int j = (i*i); j<num; j = j+i) {
                 isPrime[j] = false;
              }
           }
        }
    }
    private static long gcd(long a, long b){
        if(b==0)return a;
        return gcd(b,a%b);
    }
    public static void main(String[] args) throws IOException {
        FastReader sc = new FastReader();
        PrintWriter out = new PrintWriter(System.out);
        // primes();
        // ________________________________

        // _______________________________

        int n = sc.nextInt();
        int k = sc.nextInt();
        int[][] arr =new int[n][2];
        for(int i=0;i<n;i++){
            arr[i][1] = i;
            arr[i][0] = sc.nextInt();
        }
        LinkedList<Integer>[] adj = new LinkedList[n];
        for(int i=0;i<n;i++){
            adj[i] = new LinkedList<>();
        }
        for(int i=0;i<k;i++){
            int a = sc.nextInt();
            int b = sc.nextInt();
            a--;
            b--;
            adj[a].add(arr[b][0]);
            adj[b].add(arr[a][0]);
        }
        // out.println();
        solver(n,k,adj,arr, out);
        // ________________________________
        out.flush();
    }

    public static void solver(int n, int k, LinkedList<Integer>[] adj, int[][] arr, PrintWriter out) {
        Arrays.sort(arr, (a,b)->a[0]-b[0]);
        int prev = arr[0][0];
        int dp = 0;
        arr[0][0] = 0;
        for(int i=1;i<n;i++){
            int temp = arr[i][0];
            if(prev<temp){
                arr[i][0] = i;
            }
            else{
                arr[i][0] = dp;
            }
            prev = temp;
            dp = arr[i][0];
            for(Integer e: adj[arr[i][1]]){
                if(temp>e){
                    // System.out.println("__"+ e+" "+temp);
                    arr[i][0]--;
                }
            }
            // System.out.println(arr[i][1]+"__"+ arr[i][0]);
        }
        Arrays.sort(arr, (a,b)->a[1]-b[1]);

        for(int i=0;i<n;i++){
            out.print(arr[i][0]+" ");
        }
    }
}