#### Registered Users Only

Please login to utilize this feature.

Do note that this website only supports submissions in C++.

### Title

### Problem Statement

There are `N` students and `M` checkpoints on the `xy`-plane.

The coordinates of the `i`-th student `(1 ≤ i ≤ N)` is `(a _{i},b_{i})`, and the coordinates of the checkpoint numbered

`j`

`(1 ≤ j ≤ M)`is

`(c`.

_{j},d_{j})When the teacher gives a signal, each student has to go to the nearest checkpoint measured in

*Manhattan distance*.

The Manhattan distance between two points

`(x`and

_{1},y_{1})`(x`is

_{2},y_{2})`|x`.

_{1}-x_{2}|+|y_{1}-y_{2}|Here,

`|x|`denotes the absolute value of

`x`.

If there are multiple nearest checkpoints for a student, he/she will select the checkpoint with the smallest index.

Which checkpoint will each student go to?

### Constraints

`1 ≤ N,M ≤ 50``-10`^{8}≤ a_{i},b_{i},c_{j},d_{j}≤ 10^{8}- All input values are integers.

### Input

The input is given from Standard Input in the following format:

NMa_{1}b_{1}:a_{N}b_{N}c_{1}d_{1}:c_{M}d_{M}

### Output

Print `N` lines.

The `i`-th line `(1 ≤ i ≤ N)` should contain the index of the checkpoint for the `i`-th student to go.

### Sample Input 1

2 2 2 0 0 0 -1 0 1 0

### Sample Output 1

2 1

The Manhattan distance between the first student and each checkpoint is:

- For checkpoint
`1`:`|2-(-1)|+|0-0|=3` - For checkpoint
`2`:`|2-1|+|0-0|=1`

The nearest checkpoint is checkpoint `2`. Thus, the first line in the output should contain `2`.

The Manhattan distance between the second student and each checkpoint is:

- For checkpoint
`1`:`|0-(-1)|+|0-0|=1` - For checkpoint
`2`:`|0-1|+|0-0|=1`

When there are multiple nearest checkpoints, the student will go to the checkpoint with the smallest index. Thus, the second line in the output should contain `1`.

### Sample Input 2

3 4 10 10 -10 -10 3 3 1 2 2 3 3 5 3 5

### Sample Output 2

3 1 2

There can be multiple checkpoints at the same coordinates.

### Sample Input 3

5 5 -100000000 -100000000 -100000000 100000000 100000000 -100000000 100000000 100000000 0 0 0 0 100000000 100000000 100000000 -100000000 -100000000 100000000 -100000000 -100000000

### Sample Output 3

5 4 3 2 1

### Tags

### Subtasks and Limits

Subtask | Score | #TC | Time | Memory | Scoring |
---|---|---|---|---|---|

1 | 100 | 10 | 1s | 256MB | Minimum |

2 | 0 | 3 | 1s | 256MB | Minimum |

### Judge Compile Command

g++-8 ans.cpp -o checkpoints -Wall -Wshadow -static -O2 -lm -m64 -s -w -std=gnu++17 -fmax-errors=512