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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.io.IOException;
import java.util.ArrayList;
import java.util.TreeMap;
import java.util.Map;
import java.util.Comparator;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        FMentors solver = new FMentors();
        solver.solve(1, in, out);
        out.close();
    }

    static class FMentors {
        PrintWriter out;
        InputReader in;
        final Comparator<Tuple> com = new Comparator<Tuple>() {
            public int compare(Tuple t1, Tuple t2) {
                if (t1.x != t2.x)
                    return Integer.compare(t1.x, t2.x);
                else
                    return Integer.compare(t1.y, t2.y);
            }
        };

        public void solve(int testNumber, InputReader in, PrintWriter out) {
            this.out = out;
            this.in = in;
            int n = ni(), k = ni();
            Tuple[] arr = new Tuple[n];
            long[] power = new long[n];
            int i = 0;
            for (i = 0; i < n; i++) {
                arr[i] = new Tuple(ni(), i);
                power[i] = arr[i].x;
            }
            Arrays.sort(arr, com);
            ArrayList<Integer>[] enemies = new ArrayList[n];
            for (i = 0; i < n; i++)
                enemies[i] = new ArrayList<>();
            for (i = 0; i < k; i++) {
                int u = ni() - 1;
                int v = ni() - 1;
                enemies[u].add(v);
                enemies[v].add(u);
            }
            int[] ans = new int[n];
            TreeMap<Integer, Integer> tmap = new TreeMap<>();
            for (i = 0; i < n; i++) {
                int cnt = 0;
                for (int x : enemies[arr[i].y]) {
                    if (power[x] < power[arr[i].y])
                        cnt++;
                }
                Integer x = tmap.lowerKey(arr[i].x);
                int lol = 0;
                if (x == null)
                    lol = 0;
                else
                    lol = tmap.get(x);
                if (tmap.containsKey(arr[i].x))
                    tmap.put(arr[i].x, tmap.getOrDefault(arr[i].x, 0) + 1);
                else
                    tmap.put(arr[i].x, lol + 1);
                //pn(tmap);
                ans[arr[i].y] = lol - cnt;
                //p( lol - cnt +" ");
            }
            for (i = 0; i < n; i++)
                p(ans[i] + " ");
        }

        int ni() {
            return in.nextInt();
        }

        void p(Object o) {
            out.print(o);
        }

        class Tuple {
            int x;
            int y;

            Tuple(int a, int b) {
                x = a;
                y = b;
            }

        }

    }

    static class InputReader {
        private InputStream stream;
        private byte[] buf = new byte[1024];
        private int curChar;
        private int numChars;

        public InputReader(InputStream stream) {
            this.stream = stream;
        }

        public int read() {
            if (numChars == -1)
                throw new UnknownError();
            if (curChar >= numChars) {
                curChar = 0;
                try {
                    numChars = stream.read(buf);
                } catch (IOException e) {
                    throw new UnknownError();
                }
                if (numChars <= 0)
                    return -1;
            }
            return buf[curChar++];
        }

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

        public String next() {
            int c = read();
            while (isSpaceChar(c))
                c = read();
            StringBuffer res = new StringBuffer();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));

            return res.toString();
        }

        private boolean isSpaceChar(int c) {
            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
        }

    }
}

