Problem: 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.

Input

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 104 by absolute value. Lengths of the rods are between 1 and 200 000. 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.

Output

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.

Examples

Input

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


Output

YES
1 -1 2 -1 


Input

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


Output

YES
1 -1 2 -1 3 -1 


Input

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


Output

NO

Solution (in JAVA):

Solution:
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.List;
import java.util.Queue;
import java.awt.*;


public class CodeForces_28 implements Runnable {

    private BufferedReader br = null;
    private PrintWriter pw = null;
    private StringTokenizer stk = new StringTokenizer("");

    public static void main(String[] args) {
        new Thread(new CodeForces_28()).run();
    }

    public void run() {
        /*
         * try { // br = new BufferedReader(new FileReader("input.txt")); pw =
         * new PrintWriter("output.txt"); } catch (FileNotFoundException e) {
         * e.printStackTrace(); }
         */
        br = new BufferedReader(new InputStreamReader(System.in));
        pw = new PrintWriter(new OutputStreamWriter(System.out));
        solver();
        pw.close();

    }

    private void nline() {
        try {
            if (!stk.hasMoreTokens())
                stk = new StringTokenizer(br.readLine());
        } catch (IOException e) {
            throw new RuntimeException("KaVaBUnGO!!!", e);
        }
    }

    private String nstr() {
        while (!stk.hasMoreTokens())
            nline();
        return stk.nextToken();
    }

    private int ni() {
        return Integer.valueOf(nstr());

    }

    private double nd() {
        return Double.valueOf(nstr());

    }

    String nextLine() {
        try {
            return br.readLine();
        } catch (IOException e) {
        }
        return null;
    }



    
    private void solver() {
        int n = ni(), m = ni();
        int l[] = new int [n+1];
        int x[] = new int [n+1];
        int y[] = new int [n+1];
        int l1[] = new int [n/2+1];
        int l2[] = new int [n/2+1];
        int b[] = new int [m+1];
        for(int i=0; i<n; i++){
            x[i]=ni();
            y[i]=ni();
        }
        for(int i=0; i<n-1;i++){
            l[i]=Math.abs(x[i+1]-x[i])+Math.abs(y[i+1]-y[i]);
        }
        l[n-1]=Math.abs(x[n-1]-x[0])+Math.abs(y[n-1]-y[0]);
        for(int i=0; i<n/2;i++){
            l1[i]=l[(i*2)%n]+l[(i*2+1)%n];
            l2[i]=l[(n-1+i*2)%n]+l[(n+i*2)%n];
        }
        for(int i = 0; i<m; i++){
            b[i] = ni();
        }
    int hash[] = new int[200001];
    int check = 0;
    for(int i = 0; i<n/2; i++)hash[l1[i]]++;
    for(int i = 0; i<m; i++)hash[b[i]]--;
    boolean flag = false;
    for(int i = 0; i<200001; i++){
        if(hash[i]>0)flag = true;
        hash[i]=0;
    }
    if(!flag)check = 1;
    if(check == 0){
    for(int i = 0; i<n/2; i++)hash[l2[i]]++;
    for(int i = 0; i<m; i++)hash[b[i]]--;
    flag = false;
    for(int i = 0; i<200001; i++){
        if(hash[i]>0)flag = true;
    }
    if(!flag)check = 2; }
    if(check>0)System.out.println("YES");
    if(check == 0) System.out.println("NO");else
    if(check == 1){
        for(int i=0; i<n/2; i++){
            System.out.print(-1+" ");
            for(int j = 0; j<m;j++){
                if(l1[i]==b[j]){
                    System.out.print((j+1)+" ");
                    b[j]=-1;
                    break;
                }
            }
        }
        
        
    }else
        if(check == 2){
            for(int i=0; i<n/2; i++){
            for(int j = 0; j<m;j++){
                    if(l2[i]==b[j]){
                        System.out.print((j+1)+" ");
                        b[j]=-1;
                        break;
                    }
                }
            System.out.print(-1+" ");
            }
            
            
        }
    }

    void exit() {

        System.exit(0);
    }
}