#include <fstream>
#include <vector>
using namespace std;
const int nmax=101;

ofstream fout("dfs.out");

void ReadGraph(vector<int> G[], int &N, int &M);
void DFS(vector<int>G[], int nod, bool V[]);

int main()
{
    int N, M, cnt = 0;
    bool V[nmax];
    vector <int> G[nmax];
    ReadGraph(G, N, M);
    for(int i = 1; i <= N; ++i)
    if(V[i] = false)
    {
    cnt++;
    DFS(G, 1, V);
    }
    return 0;
}

void ReadGraph(vector<int> G[],int &N,int &M)
{
    ifstream fin("dfs.in");
    fin >> N >> M;
    int x, y;
    for(int i = 1; i <= M; ++i)
        {
            fin >> x >> y;
            G[x].push_back(y);
            G[y].push_back(x);
        }
    fin.close();
}
void DFS(vector<int> G[],int nod,bool V[])
{
    V[nod] = true;
    fout << nod << " ";
    for(int i = 0; i < G[nod].size(); ++i)
        if(V[G[nod][i]] == false) DFS(G,G[nod][i],V);
}