## FAILURE - In case of failure

To help their clients deal with faulty Cash Machines, the board of The Planar Bank has decided to stick a label expressing sincere regret and sorrow of the bank about the failure on every ATM. The very same label would gently ask the customer to calmly head to the nearest Machine (that should hopefully work fine).

In order to do so, a list of two-dimensional locations of all n ATMs has been prepared, and your task is to find for each of them the one closest with respect to the Euclidean distance.

### Input

The input contains several test cases. The very first line contains the number of cases t (t ≤ 15) that follow. Each test cases begin with the number of Cash Machines n (2 ≤ n ≤ 10^{5}). Each of the next n lines contain the coordinates of one Cash Machine x, y (0 ≤ x, y ≤ 10^{9}) separated by a space. No two points in one test case will coincide.

### Output

For each test case output n lines. i-th of them should contain the squared distance between the i-th ATM from the input and its nearest neighbour.

### Example

Input:2 10 17 41 0 34 24 19 8 28 14 12 45 5 27 31 41 11 42 45 36 27 15 0 0 1 2 2 3 3 2 4 0 8 4 7 4 6 3 6 1 8 0 11 0 12 2 13 1 14 2 15 0Output:200 100 149 100 149 52 97 52 360 97 5 2 2 2 5 1 1 2 4 5 5 2 2 2 5

Added by: | gawry |

Date: | 2014-06-06 |

Time limit: | 5s |

Source limit: | 50000B |

Memory limit: | 1536MB |

Cluster: | Cube (Intel G860) |

Languages: | All except: ASM64 |

Resource: | CEPC 2008 |