#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m;
char v[50001]={0};
vector <int> G[50001];

void read()
{
    int a,b;
    f>>n>>m;
    for(int i=1;i<=m;i++)
        {
            f>>a>>b;
            G[a].push_back(b);
            G[b].push_back(a);
        }
    f.close();
}

void dfs(int nod)
{
    v[nod]=1;
    int size=G[nod].size();
    int next_nod;
    for(int i=0;i<size;i++)
        {
            next_nod=G[nod][i];
            if(!v[next_nod]) dfs(next_nod);
        }
    g<<nod<<' ';
}

void topological_sort()
{

    for(int i=1;i<=n;i++)
        if(!v[i]) dfs(i);

    g.close();
}

int main()
{
    read();
    topological_sort();
}