Codeforces 4B Before an Exam

English

Desc

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

中文

简介

明天彼得有生物考试。他不太喜欢这个考试,但d天前,他得知他将不得不参加这个考试。彼得严厉的父母让他参加考试,并且立即准备,为此,他第i天的学习时间不小于 minTimei ,不大于 maxTimei 个小时。此外,他们警告彼得,在考试前一天,他们会检查他是如何遵循他们的指示。

所以,今天是彼得父母要他显示他的预备学习时间表的那一天。但男孩只计算的复习时间总和sumTime,现在他想知道,如果他能证明他的父母时间表sсhedule与d数字,每个数字sсhedule 我代表各彼得花在小时的时间我第i天,在生物学的研究,并满足他的父母施加的限制,并在同一时间的总和所有的日程安排我应该等于sumTime。

输入格式

第一输入行包含两个整数d,  sumTime(1≤  d  ≤30,0≤  sumTime  ≤240) 。每行包含两个整数 minTimei ,  MaxTimei (0≤  minTimei  ≤  MaxTimei ≤8 ),用空格隔开

输出格式

第一行打印YES,在第二行打印d个数字(由空格分隔),每个数字 - 彼得在相应的日子准备花费的小时数,如果他遵循父母的指示; 或在唯一行中打印NO。如果有很多解决方案,请打印其中任何一个。

测试用例

测试输入
2 5 
0 1 
3 5
测试输出
YES
1 4 
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值