Andrewid the Android is a galaxy-famous detective. He is now chasing a criminal hiding on the planet Oxa-5, the planet almost fully covered with water.

The only dry land there is an archipelago of n narrow islands located in a row. For more comfort let's represent them as non-intersecting segments on a straight line: island i has coordinates [li, ri], besides, ri < li + 1 for 1 ≤ i ≤ n - 1.

To reach the goal, Andrewid needs to place a bridge between each pair of adjacent islands. A bridge of length a can be placed between the i-th and the (i + 1)-th islads, if there are such coordinates of x and y, that li ≤ x ≤ ri, li + 1 ≤ y ≤ ri + 1 and y - x = a. 

The detective was supplied with m bridges, each bridge can be used at most once. Help him determine whether the bridges he got are enough to connect each pair of adjacent islands.

Input

The first line contains integers n (2 ≤ n ≤ 2·105) and m (1 ≤ m ≤ 2·105) — the number of islands and bridges.

Next n lines each contain two integers li and ri (1 ≤ li ≤ ri ≤ 1018) — the coordinates of the island endpoints.

The last line contains m integer numbers a1, a2, ..., am (1 ≤ ai ≤ 1018) — the lengths of the bridges that Andrewid got.

Output

If it is impossible to place a bridge between each pair of adjacent islands in the required manner, print on a single line "No" (without the quotes), otherwise print in the first line "Yes" (without the quotes), and in the second line print n - 1 numbers b1, b2, ..., bn - 1, which mean that between islands i and i + 1 there must be used a bridge number bi. 

If there are multiple correct answers, print any of them. Note that in this problem it is necessary to print "Yes" and "No" in correct case.

Examples

Input

4 4
1 4
7 8
9 10
12 14
4 5 3 8


Output

Yes
2 3 1 


Input

2 2
11 14
17 18
2 9


Output

No


Input

2 1
1 1
1000000000000000000 1000000000000000000
999999999999999999


Output

Yes
1 

Note

In the first sample test you can, for example, place the second bridge between points 3 and 8, place the third bridge between points 7 and 10 and place the first bridge between points 10 and 14.

In the second sample test the first bridge is too short and the second bridge is too long, so the solution doesn't exist.
import java.util.NavigableSet;
import java.io.OutputStreamWriter;
import java.io.BufferedWriter;
import java.util.Comparator;
import java.io.BufferedReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.io.Writer;
import java.util.LinkedList;
import java.util.SortedMap;
import java.util.Collection;
import java.util.Map;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.InputMismatchException;
import java.util.TreeMap;
import java.util.AbstractSet;
import java.util.Set;
import java.util.Iterator;
import java.util.NavigableMap;
import java.util.AbstractMap;
import java.util.NoSuchElementException;
import java.util.StringTokenizer;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 * @author Andrey Rechitsky (arechitsky@gmail.com)
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		FastScanner in = new FastScanner(inputStream);
		FastPrinter out = new FastPrinter(outputStream);
		TaskB solver = new TaskB();
		solver.solve(1, in, out);
		out.close();
	}
}

class TaskB {
    public void solve(int testNumber, FastScanner in, FastPrinter out) {
        int n = in.nextInt();
        int m = in.nextInt();
        long []l = new long[n];
        long []r = new long[n];
        for (int i = 0; i < n; i++) {
            l[i] = in.nextLong();
            r[i] = in.nextLong();
        }

        TreeLinkedMultiMap<Long,Integer> a = new TreeLinkedMultiMap<Long, Integer>();
        for (int i = 0; i < m; i++) {
            a.put(in.nextLong(), i);
        }
        TreeLinkedMultiMap<Long,Integer> sb = new TreeLinkedMultiMap<Long, Integer>();
        for (int i = 0; i < n - 1; i++) {
            sb.put(r[i+1]-l[i],i);
        }
        int []ans = new int[n-1];
        for (int v:sb.values()){
            Long brLen = a.ceilingKey(l[v+1]-r[v]);
            if (brLen==null || brLen>r[v+1]-l[v]){
                out.printLine("No");
                return;
            }
            ans[v] = a.get(brLen);
            a.removeFirst(brLen);
        }
        out.printLine("Yes");
        for (int i = 0; i < n - 1; i++) {
            out.print("%d ", ans[i]+1);
        }
        out.printLine();

    }
}

class FastScanner {

    private BufferedReader reader;
    private StringTokenizer st;

    public FastScanner(InputStream stream) {
        this.reader = new BufferedReader(new InputStreamReader(stream));
        this.st = new StringTokenizer("");
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public String next(){
        while (!st.hasMoreTokens()){
            st = new StringTokenizer(readLine());
        }
        return st.nextToken();
    }

    private String readLine() {
        try {
            String line = reader.readLine();
            if (line==null) throw new InputMismatchException();
            return line;
        } catch (IOException e) {
            throw new InputMismatchException();
        }
    }

}

class FastPrinter {
    private final PrintWriter writer;

    public FastPrinter(OutputStream outputStream) {
        writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
    }

    public void close() {
        writer.close();
    }

    public void printLine(String s) {
        writer.println(s);
    }

    public void printLine() {
        writer.println();
    }

    public void print(String s) {
        writer.print(s);
    }

    public void print(String format, Object ... args) {
        print(String.format(format, args));
    }

}

class TreeLinkedMultiMap<K,V> extends AbstractNavigableMultiMap<K,V,LinkedList<V>,TreeMap<K, LinkedList<V>>> {

    protected LinkedList<V> createCol() {
        return new LinkedList<V>();
    }

    protected TreeMap<K, LinkedList<V>> createMap() {
        return new TreeMap<K, LinkedList<V>>();
    }
}

abstract class AbstractMultiMap<K, V, ColType extends Collection<V>, MType extends Map<K,ColType>> extends AbstractMap<K,V> implements MultiMap<K,V>  {
    protected MType map;
    private Set<Entry<K, V>> entrySet;
    private int size = 0;

    abstract protected ColType createCol();
    abstract protected MType createMap();

    public AbstractMultiMap(){
        map = createMap();
    }

    public V removeFirst(Object key) {
        ColType col = map.get(key);
        V value = col.iterator().next();
        col.remove(value);
        if (col.isEmpty()) map.remove(key);
        size--;
        return value;
    }

    public Set<Entry<K, V>> entrySet() {
        Set<Entry<K, V>> es = entrySet;
        return (es != null) ? es : (entrySet = new EntrySet());
    }

    public int size() {
        return size;
    }

    public void clear() {
        map.clear();
        size = 0;
    }

    public boolean isEmpty() {
        return map.isEmpty();
    }

    public boolean containsKey(Object key) {
        return map.containsKey(key);
    }

    public V get(Object key) {
        try{
            return map.get(key).iterator().next();
        }
        catch (NoSuchElementException e) {
            return null;
        }
    }

    public V put(K key, V value) {
        if (!map.containsKey(key)) map.put(key, createCol());
        map.get(key).add(value);
        size++;
        return null;
    }

    public V remove(Object key) {
        size -= map.get(key).size();
        map.remove(key);
        return null;
    }

    public Set<K> keySet() {
        return map.keySet();
    }

    public Collection<V> values() {
        return super.values();
    }

    public Entry<K,V> getEntry(K key){
        return makeEntry(key, get(key));
    }

    final protected Entry<K,V> makeEntry(K key, V value){
        return new SimpleImmutableEntry<K, V>(key, value);
    }
    class EntrySet extends AbstractSet<Map.Entry<K,V>> {
        public Iterator<Map.Entry<K,V>> iterator() {
            return new EntryIterator();
        }

        public boolean contains(Object o) {
            if (!(o instanceof Map.Entry))
                return false;
            Map.Entry<K,V> entry = (Map.Entry<K,V>) o;
            V value = entry.getValue();
            Collection<V> c = map.get(entry.getKey());
            return c != null && c.contains(value);
        }

        public boolean remove(Object o) {
            if (!(o instanceof Map.Entry))
                return false;
            Map.Entry<K,V> entry = (Map.Entry<K,V>) o;
            V value = entry.getValue();
            Collection<V> c = map.get(entry.getKey());
            if (c != null){
                return c.remove(value);
            }
            return false;
        }

        public int size() {
            return AbstractMultiMap.this.size();
        }

        public void clear() {
            AbstractMultiMap.this.clear();
        }
    }
    final class EntryIterator implements Iterator<Entry<K, V>>{
        private Iterator<K> mapIt = map.keySet().iterator();
        private K curKey = null;
        private Iterator<V> curIt = null;

        public boolean hasNext() {
            return curIt != null && curIt.hasNext() || mapIt.hasNext();
        }

        public Entry<K, V> next() {
            if (!hasNext()) return null;
            if (curIt==null || !curIt.hasNext()){
                curKey = mapIt.next();
                curIt = map.get(curKey).iterator();
            }
            return makeEntry(curKey, curIt.next());
        }

        public void remove() {
            throw new UnsupportedOperationException();
        }

    }
}

abstract class AbstractNavigableMultiMap<K, V, ColType extends Collection<V>, MType extends NavigableMap<K,ColType>> extends AbstractMultiMap<K, V, ColType, MType> implements NavigableMap<K,V>{
    public Comparator<? super K> comparator() {
        return map.comparator();
    }

    public Entry<K, V> lowerEntry(K key) {
        return getEntry(lowerKey(key));
    }

    public K lowerKey(K key) {
        return map.lowerKey(key);
    }

    public Entry<K, V> floorEntry(K key) {
        return getEntry(floorKey(key));
    }

    public K floorKey(K key) {
        return map.floorKey(key);
    }

    public Entry<K, V> ceilingEntry(K key) {
        return getEntry(ceilingKey(key));
    }

    public K ceilingKey(K key) {
        return map.ceilingKey(key);
    }

    public Entry<K, V> higherEntry(K key) {
        return getEntry(higherKey(key));
    }

    public K higherKey(K key) {
        return map.higherKey(key);
    }

    public Entry<K, V> firstEntry() {
        return getEntry(firstKey());
    }

    public Entry<K, V> lastEntry() {
        return getEntry(lastKey());
    }

    public Entry<K, V> pollFirstEntry() {
        Entry<K, V> e = firstEntry();
        removeFirst(firstKey());
        return e;
    }

    public Entry<K, V> pollLastEntry() {
        Entry<K, V> e = lastEntry();
        removeFirst(lastKey());
        return e;
    }

    public NavigableMap<K, V> descendingMap() {
        throw new UnsupportedOperationException();
    }

    public NavigableSet<K> navigableKeySet() {
        return map.navigableKeySet();
    }

    public NavigableSet<K> descendingKeySet() {
        return map.descendingKeySet();
    }

    public NavigableMap<K, V> subMap(K fromKey, boolean fromInclusive, K toKey, boolean toInclusive) {
        throw new UnsupportedOperationException();
    }

    public NavigableMap<K, V> headMap(K toKey, boolean inclusive) {
        throw new UnsupportedOperationException();
    }

    public NavigableMap<K, V> tailMap(K fromKey, boolean inclusive) {
        throw new UnsupportedOperationException();
    }

    public SortedMap<K, V> subMap(K fromKey, K toKey) {
        throw new UnsupportedOperationException();
    }

    public SortedMap<K, V> headMap(K toKey) {
        throw new UnsupportedOperationException();
    }

    public SortedMap<K, V> tailMap(K fromKey) {
        throw new UnsupportedOperationException();
    }

    public K firstKey() {
        return map.firstKey();
    }

    public K lastKey() {
        return map.lastKey();
    }
}

interface MultiMap<K,V> extends Map<K,V> {
}
