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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Currency;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;

public class F978 {
	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());
		}
	}

	public static void main(String[] args) {
		FastReader sc = new FastReader();
		int n = sc.nextInt();
		int k = sc.nextInt();
		List<List<Integer>> arr = new ArrayList<>();
		Map<Integer, List<List<Integer>>> adj = new HashMap<>();
		Map<Integer, Integer> cntFreq = new HashMap<>();

		for (int i = 0; i < n; i++) {
			int ri = sc.nextInt();
			arr.add(Arrays.asList(i, ri));
			adj.put(i, new LinkedList<>());
		}

		for (int i = 0; i < k; i++) {
			int u = sc.nextInt() - 1;
			int v = sc.nextInt() - 1;
			adj.get(u).add(Arrays.asList(v, arr.get(v).get(1)));
			adj.get(v).add(Arrays.asList(u, arr.get(u).get(1)));
		}

		Collections.sort(arr, (a, b) -> a.get(1) - b.get(1));
		int[] res = new int[n];
		cntFreq.put(arr.get(0).get(1), 1);
		
		for (int i = 1; i < n; i++) {
			int endIdx = i - 1;
			int cnt = 0;
			int idx = arr.get(i).get(0);
			int currSkill = arr.get(i).get(1);
			
			
			if (cntFreq.containsKey(currSkill)) 
				cnt += cntFreq.get(currSkill);
			cntFreq.put(currSkill, cntFreq.getOrDefault(currSkill, 0) + 1);

			if (endIdx >= 0) {
				for (List<Integer> inQuir : adj.get(idx)) {
					if (inQuir.get(1) < currSkill)
						cnt++;
				}
			}
			
			if (endIdx + 1 - cnt > 0)
				res[idx] = endIdx + 1 - cnt;
		}

		for (int mentee : res)
			System.out.print(mentee + " ");
	}

}
