Codeforces 4B-Before an Exam（构造）

B. Before an Exam

time limit per test

1 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 dnumbers, 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 numbersminTimei, 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.

Sample test(s)

input

1 48
5 7

output

NO

input

2 5
0 1
3 5

output

YES
1 4 

题意：临近考试，主人公要在考试前d天开始准备考试，第i天复习的时间t,mintime[i]<=t<=maxtime[i]; 现在给出一个总的复习时间，问能不能实现，如果可以实现，安排出每天复习的时间。

可不可以实现，只需要sum_mintime<=sumtime<=sum_maxtime. 然后对于每天的复习时间，因为有特判，所以可以设时间差sub=sum_maxtime-sumtime. 然后从maxtime[]数组中减掉sub小时，输出maxtime[];

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <cmath>
#include <map>
using namespace std;
#define LL long long
int main()
{
	int sum,d,Max[33],Min[33];
	while(~scanf("%d %d",&d,&sum))
	{
		int Maxt=0,Mint=0;
		for(int i=0;i<d;i++)
		{
			scanf("%d %d",Min+i,Max+i);
			Mint+=Min[i];
			Maxt+=Max[i];
		}
		if(sum>=Mint&&sum<=Maxt)
		{
			puts("YES");
			int tem=Maxt-sum;
			for(int i=0;i<d;i++)
			{
				if(Max[i]-Min[i]<tem)
				{
					tem-=(Max[i]-Min[i]);
					Max[i]=Min[i];
				}
				else
				{
					Max[i]-=tem;
					break;
				}
			}
			for(int i=0;i<d;i++)
				if(i!=d-1)
				printf("%d ",Max[i]);
			    else
				printf("%d\n",Max[i]);
		}
		else
		{
			puts("NO");
		}
	}
	return 0;
}