#include <bits/stdc++.h>
#define nmax 50001
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,d[nmax],k,sol[nmax];
bool viz[nmax];
vector<int>L[nmax];
void Read()
{
    int i,x,y;
    fin>>n>>m;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        L[y].push_back(x);
    }
}
void Dfs_Sortare(int varf)
{
    int i,x;
    viz[varf]=true;
    for(i=0;i<L[varf].size();i++)
    {
        x=L[varf][i];
        if(!viz[x])
            Dfs_Sortare(x);
    }
    sol[++k]=varf;
}
void Solve()
{
    int i;
    for(i=1;i<=n;i++)
        if(!viz[i])
                Dfs_Sortare(i);
    for(i=k;i>=1;i--)
        fout<<sol[i]<<" ";
    fout<<"\n";
}
int main()
{
    Read();
    Solve();
    fin.close();
    fout.close();
    return 0;
}