ICPC 2014 · Problem B · Buffed Buffet

Time Limit: 4 seconds

You are buying lunch at a buffet. A number of different dishes are available, and you can mix and match them to your heart’s desire. Some of the dishes, such as dumplings and roasted potatoes, consist of pieces of roughly equal size, and you can pick an integral number of such pieces (no splitting is allowed). Refer to these as “discrete dishes.” Other dishes, such as tzatziki or mashed potatoes, are fluid and you can pick an arbitrary real-valued amount of them. Refer to this second type as “continuous dishes.”

Of course, you like some of the dishes more than others, but how much you like a dish also depends on how much of it you have already eaten. For instance, even if you generally prefer dumplings to potatoes, you might prefer a potato over a dumpling if you have already eaten ten dumplings. To model this, each dish $i$ has an initial tastiness $t_{i}$, and a rate of decay of the tastiness $∆t_{i}$. For discrete dishes, the tastiness you experience when eating the $n^{th}$ item of the dish is $ti - (n- 1)∆ti$. For continuous dishes, the tastiness you experience when eating an infinitesimal amount $dx$ grams of the dish after already having eaten $x$ grams is $(ti- x∆ti)dx$. In other words, the respective total amounts of tastiness you experience when eating $N$ items of a discrete dish or $X$ grams of a continuous dish are as follows:

$N$ $X$

$n=1$ $(ti- (n- 1)∆ti)$ and $Z _{X}$

$0$ $(ti- x∆ti)dx$

For simplicity, do not take into account that different dishes may or may not go well together, so define the total tastiness that you experience from a meal as the sum of the total tastinesses of the individual dishes in the meal (and the same goes for the weight of a meal – there are no food antiparticles in the buffet!).

You have spent days of painstaking research determining the numbers $t_{i}$ and $∆t_{i}$ for each of the dishes in the buffet. All that remains is to compute the maximum possible total tastiness that can be achieved in a meal of weight $w$. Better hurry up, lunch is going to be served soon!

Input

The input consists of a single test case. The first line of input consists of two integers $d$ and $w$ ($1\le d\le 250$ and $1\le w \le 10 000$), where $d$ is the number of different dishes at the buffet and $w$ is the desired total weight of your meal in grams.

Then follow $d$ lines, the $i^{th}$ of which describes the $i^{th}$ dish. Each dish description is in one of the following two forms:

• $\bullet$ A description of the form “D $wi ti ∆ti$” indicates that this is a discrete dish where each item weighs $w_{i}$ grams, with initial tastiness $t_{i}$ and decay of tastiness $∆t_{i}$.

• $\bullet$ A description of the form “C $ti ∆ti$” indicates that this is a continuous dish with initial tastiness $t_{i}$ and decay of tastiness $∆t_{i}$.

The numbers $w_{i}$, $t_{i}$, and $∆t_{i}$ are integers satisfying $1\le wi \le 10 000$ and $0\le ti,∆ti \le 10 000$.

ACM-ICPC World Finals 2014 Problem B: Buffed Buffet

Output

Display the maximum possible total tastiness of a meal of weight $w$ based on the available dishes. Give the answer with a relative or absolute error of at most $10^{- 6}$. If it is impossible to make a meal of total weight exactly $w$ based on the available dishes, display impossible.

Sample Input 1

2 15
D 4 10 1
C 6 1

Sample Output 1

40.500000000

Sample Input 2

3 15
D 4 10 1
C 6 1
C 9 3

Sample Output 2

49.000000000

Sample Input 3

2 19
D 4 5 1
D 6 3 2

Sample Output 3

impossible

ACM-ICPC World Finals 2014 Problem B: Buffed Buffet