#include <stdio.h>
#include <stdlib.h>
#define MAX 100
int graph[MAX] [MAX];
int visited[MAX];
int n, m;
void DFS(int vertex){
    printf("%d", vertex);
    visited[vertex] = 1;
    for (int i = 0; i < n; i++){
        if (graph[vertex][i]!=0 && ! visited[i]){
            DFS(i);
        }
    }
}
int main(){
    int start;
    scanf("%d",&n);
    if (n < 0){
        printf("Invalid input\n");
        return 0;
    }
scanf("%d",&m);
// Initialize adjacency matrix
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
graph[u][v] = w;
}
scanf("%d",&start);
for(int i = 0; i < n; i++)
visited[i] = 0;
printf("DFS Traversal starting from vetrex %d:\n", start);
DFS(start);
return 0;
}