|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||128 MB||0||0||0||0.000%|
As a result of an unfortunate coincidence (and a malicious bug in the university's system), Byton has an internship in an archaeologist workshop. He tries to reconstruct an ancient mosaic. He knows that originally it used to have a shape of a rectangle divided into $n$ square tiles, which could be of different sizes. Regrettably, it is neither known what were the dimensions of the rectangle, nor what were the lengths of sides of individual squares. The only things that have been deduced from the ancient texts are the positions of left lower corners of each square tile.
As it turns out, even archaeologists sometimes need help from programmers! Given input data about positions of $n$ left lower corners, find $n$ squares with sides parallel to axes, such that:
The first line of the input contains a single integer $t$ ($1 \le t \le 50$) -- the number of test cases in the input. Next, $t$ descriptions of test cases follow.
The first line of a test case contains a single integer $n$ ($1 \le n \le 2000$) -- the number of points. The next $n$ lines contain two integers each, $x_i, y_i$ ($0 \le x_i, y_i \le 10^9$) -- the coordinates of the $i$-th point. The points in a single test case are pairwise distinct.
The total number of points in all test cases in a single input file does not exceed $5000$.
For each of $t$ test cases in the input, print a single line. If for a given set, there is no correct composition of square tiles, print the word
NO. Otherwise print
YES and afterwards, $n$ positive integers; the $i$-th of these numbers should denote the length of a side of the $i$-th square in the solution. This number should not exceed $2 \cdot 10^9$. You can assume that if a test case has a solution, there exists an answer where every square tile's side has length at most $2 \cdot 10^9$. If there exist multiple solutions, you can output any of them.
3 2 0 0 0 1 2 3 2 2 3 4 1 1 2 1 3 1 1 2
YES 1 1 NO YES 1 1 3 2