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

using namespace std;
int n,m;
vector<vector<int> > graph;
vector<int> visited;
vector<int> s;
#define ALB 0
#define GRI 1
#define NEGRU 2
void dfs(int vertex)
{
    visited[vertex]=GRI;
        for(int i=0;i<graph[vertex].size();i++)
        {
            if(!visited[graph[vertex][i]])
            {
                dfs(graph[vertex][i]);
            }
        }
            visited[vertex]=NEGRU;
            s.push_back(vertex);
}
int main()
{
    ifstream f("sortaret.in");
    f>>n>>m;
    graph.resize(n);
    visited.resize(n,ALB);
    int x,y;
    for(int i=0;i<m;i++)
    {
        f>>x>>y;
        x--;
        y--;
        graph[x].push_back(y);
        graph[y].push_back(x);
    }
    for(int i=0;i<visited.size()&&i<n;i++)
    {
        if(visited[i]==ALB)
        {
            dfs(i);
        }
    }
    ofstream g("sortaret.out");
    for(int i=s.size()-1;i>=0;i--)
        g<<s[i]+1<<" ";
    f.close();
    g.close();
    return 0;
}