import java.io.InputStream; import java.io.IOException; import java.io.PrintWriter; import java.util.ArrayList; import java.util.Arrays; import java.util.Comparator; import java.util.Collections; import java.util.InputMismatchException; import java.util.NoSuchElementException; import java.util.PriorityQueue; import java.math.BigDecimal; import java.math.BigInteger; public class Main{ static PrintWriter out; static InputReader ir; static final int INF=1<<30; static final long LINF=Long.MAX_VALUE; static void solve(){ int n=ir.nextInt(); int m=ir.nextInt(); int s=ir.nextInt(); int g=ir.nextInt(); list=new AdjacencyList[n]; dist=new int[n]; prev=new int[n]; for(int i=0;i path=get_path(s); Collections.reverse(path); StringBuilder sb=new StringBuilder(); for(int ans : path){ sb.append(ans); sb.append(" "); } sb.deleteCharAt(sb.length()-1); out.println(sb); } public static void main(String[] args) throws Exception{ ir=new InputReader(System.in); out=new PrintWriter(System.out); solve(); out.flush(); } static class Edge{ int from; int to; int cost; public Edge(int from,int to,int cost){ this.from=from; this.to=to; this.cost=cost; } public Edge(int to,int cost){ this.to=to; this.cost=cost; } } static class AdjacencyList extends ArrayList{} static int[] dist,prev; static AdjacencyList[] list; public static void dijkstra(int s){ PriorityQueue pque=new PriorityQueue(19,Pair.X_ORDER); Arrays.fill(dist,INF); Arrays.fill(prev,-1); dist[s]=0; pque.offer(new Pair(0,s)); while(!pque.isEmpty()){ Pair p=pque.poll(); int v=p.y; AdjacencyList array=list[v]; if(dist[v]dist[v]+e.cost){ dist[e.to]=dist[v]+e.cost; prev[e.to]=v; pque.offer(new Pair(dist[e.to],e.to)); } else if(dist[e.to]==dist[v]+e.cost&&v ret=new ArrayList<>(); int now=g; while(now!=-1){ ret.add(now); now=prev[now]; } Collections.reverse(ret); return ret; } static class Pair{ int x; int y; public Pair(int x,int y){ this.x=x; this.y=y; } public static Comparator X_ORDER=new Comp1(); public static Comparator Y_ORDER=new Comp2(); private static class Comp1 implements Comparator{ public int compare(Pair p1,Pair p2){ return (p1.x>p2.x)?1:(p1.x{ public int compare(Pair p1,Pair p2){ return (p1.y>p2.y)?1:(p1.y=lenbuf){ curbuf= 0; try{ lenbuf=in.read(buffer); }catch(IOException e) { throw new InputMismatchException(); } if(lenbuf<=0) return false; } return true; } private int readByte(){if(hasNextByte()) return buffer[curbuf++]; else return -1;} private boolean isSpaceChar(int c){return !(c>=33&&c<=126);} private void skip(){while(hasNextByte()&&isSpaceChar(buffer[curbuf])) curbuf++;} public boolean hasNext(){skip(); return hasNextByte();} public String next(){ if(!hasNext()) throw new NoSuchElementException(); StringBuilder sb=new StringBuilder(); int b=readByte(); while(!isSpaceChar(b)){ sb.appendCodePoint(b); b=readByte(); } return sb.toString(); } public int nextInt() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } int res=0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public long nextLong() { if(!hasNext()) throw new NoSuchElementException(); int c=readByte(); while (isSpaceChar(c)) c=readByte(); boolean minus=false; if (c=='-') { minus=true; c=readByte(); } long res = 0; do{ if(c<'0'||c>'9') throw new InputMismatchException(); res=res*10+c-'0'; c=readByte(); }while(!isSpaceChar(c)); return (minus)?-res:res; } public double nextDouble(){return Double.parseDouble(next());} public BigInteger nextBigInteger(){return new BigInteger(next());} public BigDecimal nextBigDecimal(){return new BigDecimal(next());} public int[] nextIntArray(int n){ int[] a=new int[n]; for(int i=0;i