Heavy Cargo

Input

Contains one or more test cases. The first line of each test case will contain two integers: the number of cities $n$ (2 \leq n \leq 200) and the number of road segments $r$ (1 \leq r \leq 19900) making up the street network.

Then $r$ lines will follow, each one describing one road segment by naming the two cities connected by the segment and giving the weight limit for trucks that use this segment. Names are not longer than $30$ characters and do not contain white-space characters. Weight limits are integers in the range $\mathrm{0..10000}$. Roads can always be travelled in both directions.

The last line of the test case contains two city names: start and destination.

Input will be terminated by two values of $0$ for $n$ and $r$.

Output

For each test case, print three lines:

• a line saying "Scenario #x", where $x$ is the number of the test case;

• a line saying "y tons", where $y$ is the maximum possible load;

• a blank line if test case is not final;

Examples