Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official.
×

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

B. Before an Exam

time limit per test

0.5 secondmemory limit per test

64 megabytesinput

standard inputoutput

standard outputTomorrow 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 *minTime*_{i} and not more than *maxTime*_{i} 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сhedule*_{i} 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 *schedule*_{i} 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 *minTime*_{i}, *maxTime*_{i} (0 ≤ *minTime*_{i} ≤ *maxTime*_{i} ≤ 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

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/18/2018 23:27:07 (d1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|