Welcome to ZOJ
Information
Select Problem
Runs
Ranklist
ZOJ Problem Set - 4059
Kawa Exam

Time Limit: 2 Seconds      Memory Limit: 65536 KB

BaoBao is taking an online exam of the Kawa programming language, which consists of $n$ multiple choice questions. The exam is not easy, as for each question, BaoBao needs to select the one and only one correct answer from $10^5$ available choices! But don't worry, as an active committer of the famous open-kdk, BaoBao obviously knows all the correct answers.

Although BaoBao is an expert in Kawa, the developers of the exam system are definitely not experts in software engineering. There are $m$ bugs in the exam system, and the $i$-th bug can be described as $(u_i, v_i)$, which means that BaoBao must select the same choice for question $u_i$ and $v_i$ (even if the choice he selects is incorrect!).

Time is limited, and the exam must go on. The developers only have time to fix one bug. Now the developers are wondering, for all $1 \le i \le m$, what's the maximum possible number of questions BaoBao can correctly answer if they fix the $i$-th bug. Please write a program to solve this problem so that the developers can select a proper bug to fix.


This image is the cover of an album by muzzle lab.
It's not related to this problem. It only serves the purpose of making this problemset less boring.
By the way, the 3rd, 5th, 8th and 9th track in this album are really, really nice.

Input

There are multiple test cases. The first line of the input contains an integer $T$, indicating the number of test cases. For each test case:

The first line contains two integers $n$ and $m$ ($1 \le n \le 10^5$, $1 \le m \le 10^5$), indicating the number of questions and the number of bugs.

The second line contains $n$ integers $a_1, a_2, \dots, a_n$ ($1 \le a_i \le 10^5$), where $a_i$ indicates the correct answer for question $i$.

For the following $m$ lines, the $i$-th line has two integers $u_i$ and $v_i$ ($1 \le u_i, v_i \le n$), indicating the $i$-th bug.

It's guaranteed that neither the sum of $n$ nor the sum of $m$ over all test cases will exceed $10^6$.

Output

For each test case output one line containing $m$ integers $c_1, c_2, \dots, c_m$ separated by a space, where $c_i$ indicates the maximum possible number of questions BaoBao can correctly answer if the $i$-th bug is fixed.

Please, DO NOT output extra spaces at the end of each line, or your answer may be considered incorrect!

Sample Input

3
7 5
1 2 1 2 1 2 1
1 2
1 3
2 4
5 6
5 7
3 3
1 2 3
1 2
1 3
2 3
2 3
12345 54321
1 2
1 2
1 1

Sample Output

6 5 5 5 4
1 1 1
1 1 1

Hint

The following table explains the first sample test case.

  • The "possible choices" column indicates a possible set of choices to each question BaoBao can select, leading to a maximum possible number of correctly answered questions;
  • The "correct" column indicates the number of correctly answered questions using the set of choices provided in the "possible choices" column.

Bug No.Possible ChoicesCorrect
1(1, 2, 1, 2, 1, 1, 1)6
2(2, 2, 1, 2, 1, 1, 1)5
3(1, 1, 1, 2, 1, 1, 1)5
4(1, 1, 1, 1, 1, 2, 1)5
5(1, 1, 1, 1, 1, 1, 1)4

For the second sample test case, no matter which bug is fixed, BaoBao has to select the same choice for all the three questions. As the correct answer for each question is different, BaoBao can only correctly answer 1 question.

For the third sample test case, note that even if the developers fix the first bug, the second bug is still taking effect and BaoBao still has to select the same choice for the two problems. It's the same if the second bug is fixed.


Author: WENG, Caizhi
Source: The 2018 ACM-ICPC Asia Qingdao Regional Contest
Submit    Status