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 [*l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub>], besides, *r*<sub class="lower-index">*i*</sub> &lt; *l*<sub class="lower-index">*i* + 1</sub> 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 *l*<sub class="lower-index">*i*</sub> ≤ *x* ≤ *r*<sub class="lower-index">*i*</sub>, *l*<sub class="lower-index">*i* + 1</sub> ≤ *y* ≤ *r*<sub class="lower-index">*i* + 1</sub> 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.
The first line contains integers *n* (2 ≤ *n* ≤ 2·10<sup class="upper-index">5</sup>) and *m* (1 ≤ *m* ≤ 2·10<sup class="upper-index">5</sup>) — the number of islands and bridges.

Next *n* lines each contain two integers *l*<sub class="lower-index">*i*</sub> and *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> ≤ *r*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">18</sup>) — the coordinates of the island endpoints.

The last line contains *m* integer numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*m*</sub> (1 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">18</sup>) — the lengths of the bridges that Andrewid got.
#!/usr/bin/env python
# -*- coding: utf-8 -*-
n,m = map(int,input().split())
island = []
prev_island = False
for i in range(n):
    l,r = map(int,input().split())
    if i != 0:
        island.append((r - prev_island[0], l - prev_island[1],i))
    prev_island = (l,r)
island = sorted(island, key = lambda x:(x[1],x[0]))

bridges = sorted(enumerate(list(map(int,input().split()))),key = lambda x:x[1])
ans_bridges = [False for i in range(n-1)]
length = m
for land in island:
    left = 0
    right = length
    while(left + 1 < right):
        mid = (left+right)//2
        if bridges[mid][1] <= land[0]:
            left = mid
        else:
            right = mid
    if bridges[left][1] <= land[0] and bridges[left][1] >= land[1]:
        ans_bridges[land[2]-1] = bridges[left][0] + 1
        bridges.pop(left)
        length -= 1
        if length <= 0:
            break

if False not in ans_bridges:
    print('Yes')
    print(' '.join(map(str,ans_bridges)))
else:
    print('No')


