CF833E.Caramel Clouds

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

It is well-known that the best decoration for a flower bed in Sweetland are vanilla muffins. Seedlings of this plant need sun to grow up. Slastyona has mm seedlings, and the jj -th seedling needs at least kjk_{j} minutes of sunlight to grow up.

Most of the time it's sunny in Sweetland, but sometimes some caramel clouds come, the ii -th of which will appear at time moment (minute) lil_{i} and disappear at time moment rir_{i} . Of course, the clouds make shadows, and the seedlings can't grow when there is at least one cloud veiling the sun.

Slastyona wants to grow up her muffins as fast as possible. She has exactly CC candies, which is the main currency in Sweetland.

One can dispel any cloud by paying cic_{i} candies. However, in order to comply with Sweetland's Department of Meteorology regulations, one can't dispel more than two clouds.

Slastyona hasn't decided yet which of the mm seedlings will be planted at the princess' garden, so she needs your help. For each seedling determine the earliest moment it can grow up if Slastyona won't break the law and won't spend more candies than she has. Note that each of the seedlings is considered independently.

The seedlings start to grow at time moment 00 .

输入格式

The first line contains two integers nn and CC (0<=n<=3105,0<=C<=109)(0<=n<=3·10^{5},0<=C<=10^{9}) – the number of caramel clouds and the number of candies Slastyona has.

The next nn lines contain three integers each: li,ri,cil_{i},r_{i},c_{i} (0<=l_{i}<r_{i}<=10^{9},0<=c_{i}<=10^{9}) , describing one caramel cloud.

The next line contains single integer mm ( 1<=m<=3105)1<=m<=3·10^{5}) – the number of seedlings. Each of the seedlings is described with one integer kjk_{j} (1<=kj<=109)(1<=k_{j}<=10^{9}) – the required number of sunny minutes.

输出格式

For each seedling print one integer – the minimum minute Slastyona can grow it up.

输入输出样例

  • 输入#1

    3 5
    1 7 1
    1 6 2
    1 7 1
    3
    7
    2
    5
    

    输出#1

    12
    7
    10
    
  • 输入#2

    3 15
    1 4 17
    2 8 6
    4 8 9
    2
    5
    1
    

    输出#2

    8
    1
    
  • 输入#3

    2 10
    3 7 9
    10 90 10
    2
    10
    100
    

    输出#3

    10
    104
    

说明/提示

Consider the first example. For each kk it is optimal to dispel clouds 11 and 33 . Then the remaining cloud will give shadow on time segment [1..6][1..6] . So, intervals [0..1][0..1] and [6..inf)[6..inf) are sunny.

In the second example for k=1k=1 it is not necessary to dispel anything, and for k=5k=5 the best strategy is to dispel clouds 22 and 33 . This adds an additional sunny segment [4..8][4..8] , which together with [0..1][0..1] allows to grow up the muffin at the eight minute.

If the third example the two seedlings are completely different. For the first one it is necessary to dispel cloud 11 and obtain a sunny segment [0..10][0..10] . However, the same strategy gives answer 180180 for the second seedling. Instead, we can dispel cloud 22 , to make segments [0..3][0..3] and [7..inf)[7..inf) sunny, and this allows up to shorten the time to 104104 .

首页