PROGRAMMING:Ladder map
This problem requires you to implement an exclusive online map of the ladder race. After the players input their own school location and venue, the map should recommend two routes: one is the fastest route to get to the stadium; the other is the fastest route to get to the stadium; One is the shortest route. The title ensures that there is at least one accessible route on the map for any query request.
###Input format:
Enter two positive integers' n '(2 $$$Le $$'n' $$Le $$500) and'm 'in the first line, which are the number of all marked places in the map and the number of roads connecting them. Next, the'm 'line gives the information of a road in the following format:
```
V1 V2 one-way length time
```
Where 'V1' and 'V2' are the numbers of the two end points of the road (from 0 to 'n' - 1); If the road is a one-way line from 'V1' to 'V2', then 'one-way' is 1, otherwise it is 0` Length 'is the length of the road` Time 'is the time required to cross the road. Finally, a pair of starting and ending numbers are given.
###Output format:
First, output the fastest arrival time't 'and the route represented by node number in the following format:
```
Time = t: start point = > node 1 = >... = > end point
```
Then on the next line, output the shortest distance'd 'and the route represented by node number in the following format:
```
Distance = D: start point = > node 1 = >... = > end point
```
If the fastest route is not unique, output the shortest one among several fastest routes, and ensure that the route is unique. If the shortest path is not unique, the path with the least number of output path nodes is guaranteed to be unique.
If the two routes are exactly the same, output in the following format:
```
Time = T; Distance = D: start point = > node 1 = >... = > end point
```
###Input sample 1:
```in
10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
5 4 0 2 3
5 9 1 1 4
0 6 0 1 1
7 3 1 1 2
8 3 1 1 2
2 5 0 2 2
2 1 1 1 1
1 5 0 1 3
1 4 0 1 1
9 7 1 1 3
3 1 0 2 5
6 3 1 2 1
5 3
```
###Output sample 1:
```out
Time = 6: 5 => 4 => 8 => 3
Distance = 3: 5 => 1 => 3
```
###Input example 2:
```
7 9
0 4 1 1 1
1 6 1 3 1
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 3 1
3 2 1 2 1
4 5 0 2 2
6 5 1 2 1
3 5
```
###Output example 2:
```
Time = 3; Distance = 4: 3 => 2 => 5
```
answer：If there is no answer, please comment
###Input format:
Enter two positive integers' n '(2 $$$Le $$'n' $$Le $$500) and'm 'in the first line, which are the number of all marked places in the map and the number of roads connecting them. Next, the'm 'line gives the information of a road in the following format:
```
V1 V2 one-way length time
```
Where 'V1' and 'V2' are the numbers of the two end points of the road (from 0 to 'n' - 1); If the road is a one-way line from 'V1' to 'V2', then 'one-way' is 1, otherwise it is 0` Length 'is the length of the road` Time 'is the time required to cross the road. Finally, a pair of starting and ending numbers are given.
###Output format:
First, output the fastest arrival time't 'and the route represented by node number in the following format:
```
Time = t: start point = > node 1 = >... = > end point
```
Then on the next line, output the shortest distance'd 'and the route represented by node number in the following format:
```
Distance = D: start point = > node 1 = >... = > end point
```
If the fastest route is not unique, output the shortest one among several fastest routes, and ensure that the route is unique. If the shortest path is not unique, the path with the least number of output path nodes is guaranteed to be unique.
If the two routes are exactly the same, output in the following format:
```
Time = T; Distance = D: start point = > node 1 = >... = > end point
```
###Input sample 1:
```in
10 15
0 1 0 1 1
8 0 0 1 1
4 8 1 1 1
5 4 0 2 3
5 9 1 1 4
0 6 0 1 1
7 3 1 1 2
8 3 1 1 2
2 5 0 2 2
2 1 1 1 1
1 5 0 1 3
1 4 0 1 1
9 7 1 1 3
3 1 0 2 5
6 3 1 2 1
5 3
```
###Output sample 1:
```out
Time = 6: 5 => 4 => 8 => 3
Distance = 3: 5 => 1 => 3
```
###Input example 2:
```
7 9
0 4 1 1 1
1 6 1 3 1
2 6 1 1 1
2 5 1 2 2
3 0 0 1 1
3 1 1 3 1
3 2 1 2 1
4 5 0 2 2
6 5 1 2 1
3 5
```
###Output example 2:
```
Time = 3; Distance = 4: 3 => 2 => 5
```
answer：If there is no answer, please comment