Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Set Theory

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputMasha and Grisha like studying sets of positive integers.

One day Grisha has written a set *A* containing *n* different integers *a*_{i} on a blackboard. Now he asks Masha to create a set *B* containing *n* different integers *b*_{j} such that all *n*^{2} integers that can be obtained by summing up *a*_{i} and *b*_{j} 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 10^{6}, 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

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 *a*_{i} — the elements of *A* (1 ≤ *a*_{i} ≤ 10^{6}).

Output

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*b*_{j}— elements of*B*(1 ≤*b*_{j}≤ 10^{6}). If there are several possible sets, output any of them.

Example

Input

3

3

1 10 100

1

1

2

2 4

Output

YES

1 2 3

YES

1

YES

1 2

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 11:26:36 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|