4B. Before an Exam【水】

B. Before an Exam

time limit per test

0.5 second

memory limit per test

64 megabytes

input

standard input

output

standard output

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 dlines 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 

给出一个总的需要复习的时间作为目标，给出n天的每天最少复习时间和最多复习时间，问是否可以完成复习目标

注意题目要求，最少复习时间，也就是必定要复习这么多，所以直接先从最少的复习时间开始，不够的慢慢累加，最后判断输出

刚开始想复杂了，以为每天还可以不复习...

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m))
	{
		int a[255]={0},b[255]={0};
		for(int i=0;i<n;++i)
		{
			scanf("%d%d",&a[i],&b[i]);
			m-=a[i];
		}
		if(m<0)//肯定不行 
		{
			printf("NO\n");
			continue;
		}
		int ans[255]={0},cnt=0;
		for(int i=0;i<n;++i)
		{
			ans[i]=a[i];
			int tp=b[i]-a[i];
			if(tp<m)
			{
				ans[i]+=tp;
				m-=tp;
			}
			else
			{
				ans[i]+=m;
				m=0;
			}
		}
		if(m)//肯定不行 
		{
			printf("NO\n");
			continue;
		}
		printf("YES\n%d",ans[0]);
		for(int i=1;i<n;++i)
		{
			printf(" %d",ans[i]);
		}
		printf("\n");
	}
	return 0;
}