PROGRAMMING:Tourism planning

With a self driving travel map, you will know the length of the highway between cities and the toll to be charged. Now you need to write a program to help visitors find the shortest path between the departure and destination. If several paths are the shortest, the cheapest path needs to be output.
###Input format:
Input Description: the first line of input data gives four positive integers $$n $$, $$M $$, $$s $$, $$d $$, where $$n $$($$2 / Le n / Le 500 $$) is the number of cities. Incidentally, assume that the number of cities is 0 ~ ($$n-1 $$)$$ M $$is the number of expressways$$ S $$is the city number of the origin$$ D $$is the city number of the destination. In the following $$M $$lines, each line gives the information of a highway, which are: City 1, city 2, highway length and toll amount, separated by spaces, and the numbers are integers and no more than 500. Input guarantees the existence of solutions.
###Output format:
In one line, output the length of the path and the total charge. The numbers are separated by spaces. There should be no extra spaces at the end of the output.
###Input example:
```in
4 5 0 3
0 1 1 20
1 3 2 30
0 3 4 10
0 2 2 20
2 3 1 20
```
###Output example:
```out
3 40
```






answer：If there is no answer, please comment