#include<stdio.h>

int graph[max][max];
int visited[max];
int n;

void dfs(int v){
    visited[v] = 1;
    printf("%d ",v);
    for(int i=0; i<n; i++){
        if(graph[v][i] !=0 && !visited[i]){
            dfs(i);
        }
    }
}
int main(){
    scanf("%d",&n);
    int m;
    scanf("%d",&m);
    int visited[n];
    for(int i=0; i<n; i++){
        visited[i] = 0;
        for(int j=0; j<n; j++){
            graph[i][j] = 0;
        }
    }
    int e,v,w;
    scanf("%d %d %d",&e,&v,&w);
    for(int i=0; i<m; i++){
        graph[v][e] = w;
    }
    
    int start;
    scanf("%d",&start);
    printf("DFS Traversal starting from %d: ",start);
    dfs(start);
    return 0;
}