Final round completed


Show one task per page / all tasks on one page

"A" Set Theory
Time limit 2 seconds
Memory limit 256 megabytes

Masha and Grisha like studying sets of positive integers.

One day Grisha has written a set A containing n different integers ai on a blackboard. Now he asks Masha to create a set B containing n different integers bj such that all n2 integers that can be obtained by summing up ai and bj for all possible pairs of i and j are different.

Both Masha and Grisha don't like big numbers, so all numbers in A are from 1 to 106, and all numbers in B must also be in the same range.

Help Masha to create the set B that satisfies Grisha's requirement.

Input format

Input data contains multiple test cases. The first line contains an integer t — the number of test cases (1 ≤ t ≤ 100).

Each test case is described in the following way: the first line of the description contains one integer n — the number of elements in A (1 ≤ n ≤ 100).

The second line contains n integers ai — the elements of A (1 ≤ ai ≤ 106).

Output format

For each test first print the answer:

  • NO, if Masha's task is impossible to solve, there is no way to create the required set B.
  • YES, if there is the way to create the required set. In this case the second line must contain n different positive integers bj — elements of B (1 ≤ bj ≤ 106). If there are several possible sets, output any of them.

Input data
1 10 100
2 4
Output data
1 2 3 
1 2 

Send solution

Upload Maximal size is 256kb

Log in

VK Facebook It.Mail

Forgot password?


The instruction for password recovery
has been sent to your email