1 #include<queue>
 2 #include<cstdio>
 3 #include<cstring>
 4 #define M 420000
 5 #define N 420
 6 using namespace std;
 7 struct hehe{
 8     int x;
 9     int y;
10     hehe(){};
11     hehe(int xx,int yy){
12         x=xx;
13         y=yy;
14     }
15 };
16 queue<hehe>q;
17 double dis[N][521];
18 int next[M],to[M],v[M],l[M],head[N],num,exist[N][521],pre1[N][521],pre2[N][521],n,m,p;
19 void add(int false_from,int false_to,int false_v,int false_l){
20     next[++num]=head[false_from];
21     to[num]=false_to;
22     v[num]=false_v;
23     l[num]=false_l;
24     head[false_from]=num;
25 }
26 void spfa(){
27     memset(dis,66,sizeof dis);
28     q.push(hehe(1,70));
29     exist[1][70]=1;
30     dis[1][70]=0;
31     while(!q.empty()){
32         hehe u=q.front();
33         q.pop();
34         exist[u.x][u.y]=0;
35         for(int i=head[u.x];i;i=next[i]){
36             if(!v[i]){
37                 if(1.0*l[i]/u.y+dis[u.x][u.y]<dis[to[i]][u.y]){
38                     dis[to[i]][u.y]=1.0*l[i]/u.y+dis[u.x][u.y];
39                     pre1[to[i]][u.y]=u.x;
40                     pre2[to[i]][u.y]=u.y;
41                     if(!exist[to[i]][u.y]){
42                         exist[to[i]][u.y]=1;
43                         q.push(hehe(to[i],u.y));
44                     }
45                 }
46             }
47             else{
48                 if(1.0*l[i]/v[i]+dis[u.x][u.y]<dis[to[i]][v[i]]){
49                     dis[to[i]][v[i]]=1.0*l[i]/v[i]+dis[u.x][u.y];
50                     pre1[to[i]][v[i]]=u.x;
51                     pre2[to[i]][v[i]]=u.y;
52                     if(!exist[to[i]][v[i]]){
53                         exist[to[i]][v[i]]=1;
54                         q.push(hehe(to[i],v[i]));
55                     }
56                 }
57             }
58         }
59     }
60 }
61 void print(int a,int b){
62     if(a!=1)
63         print(pre1[a][b],pre2[a][b]);
64     printf("%d ",a-1);
65 }
66 int main(){
67     scanf("%d%d%d",&n,&m,&p);
68     p++;
69     for(int i=1;i<=m;++i){
70         int a,b,c,d;
71         scanf("%d%d%d%d",&a,&b,&c,&d);
72         add(a+1,b+1,c,d);
73     }
74     spfa();
75     double mmin=1e30;
76     int minn=0;
77     for(int i=1;i<=500;i++)
78         if(mmin>dis[p][i]){
79             mmin=dis[p][i];
80             minn=i;
81         }
82     print(pre1[p][minn],pre2[p][minn]);
83     printf("%d\n",p-1);
84     return 0;
85 }