path.
The second line contains the list of vertices of the shortest path from s to e. Each vertex separated
by one comma.
Sample Input 1
8 16 07
0 1 5
0 2 3
0 5 11
1
2 5
1 6 7
1 7 11
23 11
2 4 1
2 5 7
3 4 11
3 6 11
4 5 1
4 65
4 7 7
57 42
67 42
Sample Output 1
11
0,2,4,7
Sample Input 2
6 7 1 4
0 1 7
Sample Output 2
15
1,0,2,4
0 25
0 5 1
2 32
24 3
3 4 7
FUD 59
