Dangerous Route
Professor Dijkstra resides in a particularly dangerous part of the city, where bandits frequently rob pedestrians on the streets. By analyzing crime reports, he has determined the probability of being robbed on each street in the city.
His goal is to identify the safest route from his home to the university where he teaches. Specifically, he seeks a path from his house to the university that minimizes the probability of being robbed.
Input
The first line of the input contains two integers, N and M, representing the number of buildings and the number of streets connecting these buildings, respectively (1 ≤ N ≤ 100, 1 ≤ M ≤ N(N-1)/2). The following line contains two integers, S and F, which denote the building number where the professor resides and the building number where the university is located. The next M lines describe the roads, each with three integers S_i, F_i, and P_i. These represent the starting and ending building numbers of the road, and the probability of being robbed on that road, expressed as a percentage (1 ≤ S_i ≤ N, 1 ≤ F_i ≤ N, 0 ≤ P_i ≤ 100). All roads are bidirectional. It is guaranteed that there is at least one path from the professor's house to the university.
Output
Output a single number, which is the minimum possible probability of being robbed, with a precision of at least 6 decimal places.