SP15431 UCV2013C - Farmer Cream

Farmer Cream is a businessman that wants to live in the suburbs. He recently bought a little farm in Creamville and wants to earn money from it. After the sell, Farmer Cream has D money a remaining to spend. He's in negotiations with an important firm of farming but he thinks they're not being honest (they're trying to steal some money). He knows the number of fences F in the farm but he doesn't know the number of plots P to farm. The firm is offering a budget B per plot, so he needs to multiply the budget per the number of plots to know the total amount of money to spend. He needs to know if he accepts the contract, for that, he needs to have at least M money to live after the buy. Otherwise, the firm is trying to bankrupt Farmer Cream and take over the farm. In order to do this. Farmer Cream needs your help. Assuming the fences are lines y = ax + b he only knows three things about them. 1. There is no point in the farm where 3 or more fences collides. So, in one point of the farm there'll be zero, one or two fences. 2. There are no parallel fences in the farm. So if we have two fences represented by y1 = a1x1 + b1 and y2 = a2x2 + b2 we assume that a1 a2. 3. All the fences collide with each other  In the example, there are 3 fences and 7 plots.

The input contains several test cases, each one corresponding to a different situation. Each test case consists of a single line with four integers D F B M (1

For each test case, you'll print: "The firm is trying to bankrupt Farmer Cream by X Bsf." where X represents the difference between money to spend plus the money he needs to survive and the money Farmer Cream has. Otherwise, you'll print "Farmer Cream will have Y Bsf to spend." where Y represents the money Farmer Cream will have to spend.