There are more test cases. Each test case starts with a line containing four positive integers T,
F, Fu, Fn. T represents the number of trade offers, F represents the number of types of plankton
food. The types of food are labeled 1, 2, ..., F. Fu is the label of the unnecessary food which the
organizing ZOO is offering, Fn is the label of the necessary food which it wants to obtain by the
trade. Next, there are T lines, each line represents a particular trade offer of a particular ZOO.
The offer is expressed by three values Fr, Fg, U. Fr and Fg are labels of particular food types.
The third number, U, is the natural logarithm (the use of logarithms in the ZOO is very popular
because of the large range of sizes of the animals) of the amount of units of plankton food of
type Fg which the offering ZOO is willing to give in exchange of receiving 1 unit of plankton
food of type Fr. The value of U is a decimal number with at most three digits after the decimal
point and with absolute value less than or equal to 1 000. Note that the identification of the
offering ZOO has been stripped away, as it is not essential for the solution of the problem. The
value of T does not exceed 10 000, the value of F does not exceed 5 000.
The input is terminated by a line with four zeros.
For each test case print on a separate line either “TRUE” or “FALSE”. Print “TRUE” if and only
if there is a way to organize the exchanges in such way that an investment of a limited volume
of the unnecessary food type can result in theoretically unlimited supply of the necessary food
type.