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.ArrayList;
import java.util.Collections;
import java.util.InputMismatchException;
import java.util.List;

/**
 * @author tainic on May 13, 2018
 */
public class Main {

    private static boolean LOCAL = true;
    static {
        try {
            System.getenv();
        } catch (Exception e) {
            LOCAL = false;
        }
    }

    public static void main(String[] args) {
        InputReader in = new StreamInputReader(System.in, 2048);
        if (LOCAL) {
            in = new StreamInputReader(new ByteArrayInputStream((
                "10 4\n" +
                "5 4 1 5 4 3 7 1 2 5\n" +
                "4 6\n" +
                "2 1\n" +
                "10 8\n" +
                "3 5"
            ).getBytes()));
        }
        PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out, 2048), false);

        int n = in.nextInt();
        int q = in.nextInt();
        List<P> a = new ArrayList<>(n);
        long[] r = new long[n + 1];
        for (int i = 1; i <= n; i++) {
            r[i] = in.nextLong();
            a.add(new P(i, r[i]));
        }
        Collections.sort(a);

        int[] c = new int[n + 1];
        P prev = null;
        int k = 0;
        for (P p : a) {
            k++;
            if (prev != null) {
                if (prev.r == p.r) {
                    c[p.i] = c[prev.i];
                } else {
                    c[p.i] = k - 1;
                }
            }
            prev = p;
        }

        for (int i = 0; i < q; i++) {
            int x = in.nextInt();
            int y = in.nextInt();
            if (r[x] > r[y]) {
                c[x]--;
            } else if (r[x] < r[y]) {
                c[y]--;
            }
        }

        for (int i = 1; i <= n; i++) {
            if (i > 1) {
                out.print(" ");
            }
            out.print(c[i]);
        }

        out.close();
    }

    static class P implements Comparable<P> {
        int i;
        long r;

        public P(int i, long r) {
            this.i = i;
            this.r = r;
        }

        @Override
        public int compareTo(P o) {
            return Long.compare(r, o.r);
        }

    }

    //region fast io
    abstract static class InputReader {

        public abstract int read();

        public int nextInt() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            int res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public long nextLong() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            int sgn = 1;
            if (c == '-') {
                sgn = -1;
                c = read();
            }
            long res = 0;
            do {
                if (c < '0' || c > '9') {
                    throw new InputMismatchException();
                }
                res *= 10;
                res += c - '0';
                c = read();
            } while (!isSpaceChar(c));
            return res * sgn;
        }

        public String nextString() {
            int c = read();
            while (isSpaceChar(c)) {
                c = read();
            }
            StringBuilder res = new StringBuilder();
            do {
                res.appendCodePoint(c);
                c = read();
            } while (!isSpaceChar(c));
            return res.toString();
        }

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

    static class StreamInputReader extends InputReader {

        private InputStream stream;
        private byte[] buf;
        private int curChar, numChars;

        public StreamInputReader(InputStream stream) {
            this(stream, 2048);
        }

        public StreamInputReader(InputStream stream, int bufSize) {
            this.stream = stream;
            this.buf = new byte[bufSize];
        }

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

}