#include <cstdio>
#include <vector>
#include <algorithm>
#define NMAX 100005

using namespace std;

int n,m,x,y,i,k;
vector<int>v[NMAX];
int sol[NMAX],viz[NMAX];

void DFS(int nod)
{
    int i;
    viz[nod]=1;
    for(i=0;i<v[nod].size();++i)
        if(viz[v[nod][i]] == 0) DFS(v[nod][i]);
    sol[++k]=nod;
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;++i) {
        scanf("%d%d",&x,&y);
        v[x].push_back(y);
        v[y].push_back(x);
    }
    for(int i = 1; i <= n; ++i)
    {
        sort(v[i].begin(),v[i].end());
    }
    for(i=1;i<=n;++i)
    {
        if(viz[i] == 0) DFS(i);
    }
    for(i=k;i>=1;--i) printf("%d ",sol[i]);
    return 0;
}