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.
import heapq

n, m = map(int, input().split())
islands = [list(map(int, input().split())) for _ in range(n)]

bag = []

for idx in range(n - 1):
    bag.append((islands[idx + 1][0] - islands[idx][1],
                islands[idx + 1][1] - islands[idx][0],
                idx)
               )
bag.sort()

bridges = []
num = 1
for item in map(int, input().split()):
    bridges.append((item, num))
    num += 1

bridges.sort()
heap = []
ans = []
i = 0
idx = 0
while (idx < m):
    if i < n - 1 and bag[i][0] <= bridges[idx][0]:
        heapq.heappush(heap, (bag[i][1], bag[i][2]))
        i += 1
    else:
        if len(heap) > 0:
            tmp = heapq.heappop(heap)
            if tmp[0] >= bridges[idx][0]:
                ans.append((tmp[1], bridges[idx][1]))
            else:
                idx = -1
                break
        idx += 1
ans.sort()
if idx != -1 and len(heap) == 0:
    print('Yes')
    print(' '.join([str(item[1]) for item in ans]))
else:
    print('No')