#include<cstdio>
#include<vector>
#include<queue>

using namespace std;

int n,m,dist[10000];
vector<int> gr[10000]; ///gr - array of vectors of ints, gr[i]-vector of ints, gr[i][j] - int
bool used[10000];

void init(){
    int from,to;

    scanf("%d %d",&n,&m);///number of vertices and number of edges

    for(int i=0;i<m;i++){
        scanf("%d %d",&from,&to);///read an edge

        gr[from].push_back(to);///to becomes a neighbor of from (since the edge is from->to)
        gr[to].push_back(from);///only if the graph is undirected. from becomes a neighbor of to. (since the edge is two way). If this row is skipped the graph becomes directed
    }
}

///breath first search
void bfs(int start){
    queue<int>toVisit;
    int node;

    toVisit.push(start);///add the starting vertice to the queue
    used[start]=1;///mark it as visited (since the algorithm requires that a vertice is marked as visited as soon as it enters the queue)
    dist[start]=0;///the distance to the starting node is 0 (since we start there)

    while(!toVisit.empty()){///while there are vertices to be visited
        node = toVisit.front();///take one
        toVisit.pop();///remove it from queue
        printf("%d ",node);

        for(int i=0;i<gr[node].size();i++){///for each of its neighbors
            if(used[gr[node][i]])continue;///if it is visited skip

            toVisit.push(gr[node][i]);///else add to the queue
            used[gr[node][i]]=1;///and mark as visited
            dist[gr[node][i]]=dist[node]+1;///the distance to the neighbor is the distance to the current node + 1, since there is an edge between them.
        }
    }
}

///depth first search
void dfs(int node){
    used[node]=1;///mark the node as visited
    printf("%d ",node);

    for(int i=0;i<gr[node].size();i++){///for each of its neighbors
        if(used[gr[node][i]])continue;///if it is visited to nothing

        dfs(gr[node][i]);///else visit the neighbor
    }
}

int main(){
    init();
    dfs(7);
}
/**
9 8
0 1
1 3
0 2
1 7
4 5
3 6
3 8
1 8
*/