using System; using System.Collections.Generic; using System.Collections; using System.Collections.Specialized; using System.Linq; using System.Text; using System.IO; using System.Reflection; using static System.Math; using System.Numerics; static class Program{ const int mod=(int)1e9+7; const long inf=long.MaxValue-1; static List>[] li; static bool[] b; static void Main(){ Sc sc=new Sc(); var s=sc.Ia; int n=s[0],m=s[1]; li=new List>[n]; b=new bool[n]; var c=new long[n]; var f=new int[n]; for(int i=0;i>(); c[i]=inf; } for(int i=0;i(32); pq.Push(new Rheap.Dt(0,s[3])); c[s[3]]=0; f[s[3]]=-1; while(pq.cnt>0){ var e=pq.Dequeue; if(b[e.d]){continue;} b[e.d]=true; for(int i=0;ili[e.d][i].Item2+e.n){ pq.Push(new Rheap.Dt(li[e.d][i].Item2+e.n,li[e.d][i].Item1)); c[li[e.d][i].Item1]=li[e.d][i].Item2+e.n; f[li[e.d][i].Item1]=e.d; } else if(c[li[e.d][i].Item1]==li[e.d][i].Item2+e.n&&f[li[e.d][i].Item1]>e.d){ f[li[e.d][i].Item1]=e.d; } } } var ans=s[2].ToString(); int a=f[s[2]]; while(a!=-1){ ans=ans+" "+a; a=f[a]; } Console.WriteLine("{0}",ans); } } public class Rheap{ public class Dt{ public long n; public T d; public Dt(long n,T d){this.n=n;this.d=d;} public override string ToString()=>"d:"+d.ToString()+" n:"+n.ToString(); } private const int m=65; private long la=0; private Dt[][] bf; private int[] h; public int cnt=0; public Rheap(int max){ bf=new Dt[m][]; h=new int[m]; for(int i = 0;i0){ int p=0; for(int j = 1;jbf[i][j].n){p=j;} } la=bf[i][p].n; for(int j = 0;j(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i(int n,Func f){var a=new T[n];for(int i=0;i