Shooting Practice

Jeongwoo, who wants to improve his FPS game skills, is practicing target shooting. In this drill, the computer screen is treated as a two-dimensional coordinate plane, so the position of each target can be written as coordinates. Moving right increases the $x$ value, and moving up increases the $y$ value.

At the start, the mouse cursor is always at $(0, 0)$, and $N$ targets are on the screen. When the cursor moves to a target and clicks it, that target disappears and Jeongwoo earns points. The points earned equal the squared distance from the cursor's position before the move to that target. The distance is the Euclidean distance, which is the straight-line distance between two points.

Whenever a target is removed, a new target appears on the screen. Jeongwoo uses a strategy where each move hits the target that is farthest from the current cursor position. Find the total score Jeongwoo earns after repeating this process $M$ times. No two targets appear at the same position, and before each move the farthest target from the cursor is always unique.

The first line contains two integers $N$ and $M$, separated by a space. $(1 \le N, M \le 100)$

From the second line onward, the next $N$ lines each contain two integers $x_i$ and $y_i$, separated by a space, giving the coordinates of the targets currently on the screen. $(-100 \le x_i, y_i \le 100)$

The next $M$ lines each contain two integers $x_j$ and $y_j$ in order, giving the coordinates of the targets that appear next. $(-100 \le x_j, y_j \le 100)$

Print the total score Jeongwoo earns.