1 #include <bits/stdc++.h>
 2 using namespace std;
 3 #define maxn 510
 4 #define For(I,A,B) for(int I = (A); I < (B); I++)
 5 int n,m,s,d;
 6 bool vis[maxn];
 7 int dist[maxn][maxn];
 8 int cost[maxn][maxn];
 9 int cur_path[maxn],path[maxn];
10 int mindis,minc,len;
11
12 void dfs(int node,int dis,int cc,int deep)
13 {
14     cur_path[deep] = node;
15     if(node == d)
16     {
17         if(dis < mindis)
18         {
19             mindis = dis;
20             minc = cc;
21             len = deep;
22             For(i,0,deep + 1)
23                 path[i] = cur_path[i];
24         }
25         else if (dis == mindis && cc < minc)
26         {
27             mindis = dis;
28             minc = cc;
29             len = deep;
30             For(i,0,deep + 1)
31                 path[i] = cur_path[i];
32         }
33         return;
34     }
35     For(i,0,n)
36     {
37         if(!vis[i] && dist[i][node] != -1)
38         {
39             vis[i] = 1;
40             dfs(i,dis + dist[i][node],cc + cost[node][i],deep + 1);
41             vis[i] = 0;
42         }
43     }
44 }
45 int main()
46 {
47     //freopen("1030.in","r",stdin);
48     while(scanf("%d%d%d%d",&n,&m,&s,&d) != EOF)
49     {
50         int t1,t2;
51         mindis = minc = INT_MAX;
52         For(i,0,n)
53             For(j,0,n)
54             dist[i][j] = -1;
55         For(i,0,m)
56         {
57             scanf("%d%d",&t1,&t2);
58             scanf("%d%d",&dist[t1][t2],&cost[t1][t2]);
59             dist[t2][t1] = dist[t1][t2];
60             cost[t2][t1] = cost[t1][t2];
61         }
62         vis[s] = 1;
63         dfs(s,0,0,0);
64         For(i,0,len + 1)
65             cout<<path[i]<<" ";
66         cout<<mindis<<" "<<minc<<endl;
67     }
68     return 0;
69 }