Your are given ` N` points in a plane, the coordinates of a Boss Point -

`- and an integer`

**(xBoss, yBoss)**`.`

**K** Find the ` K` nearest points to the Boss Point and print them in order of ascending distance between them and the Boss Point.

If two points have same distance to Boss Point, print them in lexicographic order.

### Input

The first line contains integers ` N` and

`.`

**K**The second line contains the coordinates

`,`

**xBoss**`.`

**yBoss**Each of the following

**lines contains the coordinates**

`N`**of a point.**

`(x`_{i}, y_{i})### Output

You should print the ` K` nearest points to the Boss Point.

### Restrictions

`1 ≤ N, K ≤ 10`^{4}`-10`^{4}≤ xBoss, yBoss, x, y ≤ 10^{4}- All points have integer coordinates.
- The distance metric used in this problem is the Euclidean distance
- A point
`(x`comes before_{1}, y_{1})`(x`in lexicographic order if_{2}, y_{2})`x`_{1}< x_{2}|| (x_{1}== x_{2}&& y_{1}< y_{2})

### Sample

Input | Output |
---|---|

3 20 0 2 2 -2 -2 1 1 | 1 1-2 -2 |