Problem: Tomorrow Peter has a Biology exam. He does not like this subject much, but d days ago he learnt that he would have to take this exam. Peter's strict parents made him prepare for the exam immediately, for this purpose he has to study not less than minTimei and not more than maxTimei hours per each i-th day. Moreover, they warned Peter that a day before the exam they would check how he has followed their instructions.

So, today is the day when Peter's parents ask him to show the timetable of his preparatory studies. But the boy has counted only the sum of hours sumTime spent him on preparation, and now he wants to know if he can show his parents a timetable sсhedule with d numbers, where each number sсhedulei stands for the time in hours spent by Peter each i-th day on biology studies, and satisfying the limitations imposed by his parents, and at the same time the sum total of all schedulei should equal to sumTime.

Input

The first input line contains two integer numbers d, sumTime (1 ≤ d ≤ 30, 0 ≤ sumTime ≤ 240) — the amount of days, during which Peter studied, and the total amount of hours, spent on preparation. Each of the following d lines contains two integer numbers minTimei, maxTimei (0 ≤ minTimei ≤ maxTimei ≤ 8), separated by a space — minimum and maximum amount of hours that Peter could spent in the i-th day.

Output

In the first line print YES, and in the second line print d numbers (separated by a space), each of the numbers — amount of hours, spent by Peter on preparation in the corresponding day, if he followed his parents' instructions; or print NO in the unique line. If there are many solutions, print any of them.

Examples

Input

1 48
5 7


Output

NO


Input

2 5
0 1
3 5


Output

YES
1 4 

Solution (in PYTHON3):

Solution:
# введем два массива a_min, a_max;
d, n = list(map(int, input().split()))
a_min = []
a_max = []
for i in range(d):
    x, y = list(map(int, input().split()))
    a_min.append(x)
    a_max.append(y)
# создадим из них накопленные суммы
# cum_min[0] = 0
# cum_min[1] = cum_min[0] + a_min[0], 
# cum_min[2] = cum_min[1] + a_min[1]...

# аналогично cum_max
cum_min = [0]
for i in range(1, d + 1):
    cum_min.append(cum_min[i - 1] + a_min[i - 1])

cum_max = [0]
for i in range(1, d + 1):
    cum_max.append(cum_max[i - 1] + a_max[i - 1])

# если cum_min[d] < s < cum_max[d] - отчитаться возможно, выводим yes
# будем создавать отчет rep[i]; rep[d] = sum, rep[0] = 0.
# для каждого i должно выполнятся
# amin[i-1] <= rep[i] - rep[i-1] <= a_max[i-1]
# кроме того должно выполняться cum_min[i]<=rep[i] <= cum_max[i]
# -amin[i] >= rep[i-1] - rep[i] >= -a_max[i-1]
# rep[i]-amin[i-1] >= rep[i-1]  >= rep[i]-a_max[i-1]


# видимо в качестве rep[i] можно взять минимум cum_max[i] и rep[i+1] - amin[i+1]
# счет необходимо вести в обратном порядке
# rep[d] присвоить n, дальше вычислять последовательно для d-1..0

if not(cum_min[d] <= n <= cum_max[d]):
    print('NO')
else:
    print('YES')
    rep = list(range(d + 1))
    rep[d] = n
    for i in range(d, 0, -1):
        rep[i - 1] = (min(cum_max[i - 1], rep[i] - a_min[i-1]))
    # в конце по rep[i] восстанавливаем отчет (отчет[i] = rep[i] - rep[i-1])
    for i in range(d):
        print(rep[i + 1] - rep[i], end = " ")