A - Before an Exam

A - Before an Exam

Crawling in process... Crawling failed

Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u

Description

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

Sample Input

Input

1 48
5 7

Output

NO

Input

2 5
0 1
3 5

Output

YES
1 4 

题目大意：

有n组数据，每组一个最小值min和最大值max值，另外有一个中和sum值。求出n个介于min和max之间的数，让它们的和为sum。如果不存在，就输出“NO”；如果存在，就输出任意一组值。

解题思路：

先将各组的最大最小值分别加起来求和Maxsum，Minsum，如果sum不在Maxsum与Minsum之间，则直接输出“NO”即可，否则 可以先从sum中减去所有的min，然后对剩下的值进行处理，对其分配时不能超过每一对max-min的值，如果能全部分完，则可以。

代码如下：

#include<iostream>
#include<cstdio>
using namespace std;
int main()
{
    int i,d,Maxsum=0,Minsum=0,sum,s,MAX[35],MIN[35];
    scanf("%d%d",&d,&sum);
    for(i=0;i<d;i++)
    {
        scanf("%d%d",&MIN[i],&MAX[i]);
        Minsum+=MIN[i];
        Maxsum+=MAX[i];
    }
    if(sum>=Minsum&&sum<=Maxsum)
    {
        printf("YES\n");
        s=Maxsum-sum;
        for(i=0;i<d;i++)
        {
            if(MAX[i]-MIN[i]<s)
            {
                s-=(MAX[i]-MIN[i]);
                MAX[i]=MIN[i];
            }
            else
            {
                MAX[i]-=s;
                break;
            }
        }
        for(i=0;i<d;i++)
            if(i!=d-1)
				printf("%d ",MAX[i]);
            else
				printf("%d\n",MAX[i]);
		}
    else
        printf("NO\n");
    return 0;
}