#include <bits/stdc++.h>
using namespace std;
vector<int>v[50005];
stack<int>st;
bitset<100005>fr;
void dfs(int nod)
{
    fr[nod]=1;
    int i,u;
    for(i=0;i<v[nod].size();i++)
    {
        u=v[nod][i];
        if(fr[u]==0)
        {
            dfs(u);
        }
    }
    st.push(nod);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    int n,m,i,j,a,b;
    scanf("%d%d",&n,&m);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
        v[b].push_back(a);
    }
    for(i=1;i<=n;i++)
        if(fr[i]==false)
        dfs(i);
        while(!st.empty())
        {
            printf("%d ",st.top());st.pop();
        }
    return 0;
}