#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int v, e;
int x, y;
vector<int> graph[50005];
stack<int>s;
bool viz[50005];

void dfs(int vf)
{
    for(auto& vec:graph[vf])
    {
        if(viz[vec] == 0)
        {
            viz[vec]=1;
            dfs(vec);
        }
    }
    s.push(vf);
}

int main() {

    f>>v>>e;
    for(int i=1; i<=v; i++)
    {
        f>>x>>y;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }
    int nr=0;
    for(int i=1; i<=v; i++)
    {
        if(viz[i] == 0)
        {
            viz[i]=1;
            dfs(i);
        }
    }
    while(!s.empty())
    {
        g<<s.top()<<' ';
        s.pop();
    }
    return 0;
}