Bender Problem

题面翻译

题意：有n个钉子，从1~n编号，有m条铁棒，要求用这些铁棒和钉子围成一个封闭的折线。要求铁棒不一定全部用完，铁棒必须平行于坐标轴。现在他要把铁棒弯成直角，这样中间的折叠点一个钉子，两头各一个钉子，要求折叠的这颗钉子之前必须是没有别的棒连接的（也就是空钉子），问怎么选棒，棒只能用一次

题目描述

Robot Bender decided to make Fray a birthday present. He drove $n$ nails and numbered them from $1$ to $n$ in some order. Bender decided to make a picture using metal rods. The picture is a closed polyline, which vertices should be nails (in the given order). The segments of the polyline should be parallel to the coordinate axes. Polyline is allowed to have self-intersections. Bender can take a rod and fold it exactly once in any place to form an angle of 90 degrees. Then he can attach the place of the fold to some unoccupied nail and attach two ends of this rod to adjacent nails. A nail is considered unoccupied if there is no rod attached to it (neither by it's end nor the by the fold place). No rod could be used twice. It is not required to use all the rods.

Help Bender to solve this difficult task.

输入格式

The first line contains two positive integers $n$ and $m$ ( $4<=n<=500,2<=m<=500$ , $n$ is even) — the amount of nails and the amount of rods. $i$ -th of the following $n$ lines contains a pair of integers, denoting the coordinates of the $i$ -th nail. Nails should be connected in the same order as they are given in the input. The last line contains $m$ integers — the lenghts of the rods. All coordinates do not exceed $10^{4}$ by absolute value. Lengths of the rods are between $1$ and $200000$ . No rod can be used twice. It is guaranteed that all segments of the given polyline are parallel to coordinate axes. No three consecutive nails lie on the same line.

输出格式

If it is impossible to solve Bender's problem, output NO. Otherwise, output YES in the first line, and in the second line output $n$ numbers — $i$ -th of them should be the number of rod, which fold place is attached to the $i$ -th nail, or -1, if there is no such rod.

If there are multiple solutions, print any of them.

样例 #1

样例输入 #1

4 2
0 0
0 2
2 2
2 0
4 4

样例输出 #1

YES
1 -1 2 -1

样例 #2

样例输入 #2

6 3
0 0
1 0
1 1
2 1
2 2
0 2
3 2 3

样例输出 #2

YES
1 -1 2 -1 3 -1

样例 #3

样例输入 #3

6 3
0 0
1 0
1 1
2 1
2 2
0 2
2 2 3

样例输出 #3

NO