#include <iostream>
#include<fstream>
#include <vector>
#include <stack>
#define nn 50001
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int>m[nn];
stack<int>s;
int n,nr,i,j,viz[nn];
void Topsort(int x)
{
    viz[x]=1;
    vector<int>::iterator it;
    for(it=m[x].begin();it!=m[x].end();it++)
        if(viz[*it==0])Topsort(*it);
    s.push(x);
}
int main()
{
    f>>n>>nr;
    while(f>>i>>j)
    {
        m[i].push_back(j);
        m[j].push_back(i);
    }
    for(i=1;i<=n;i++)
        if(viz[i]==0)Topsort(i);
    while(s.empty()==false)
    {
        g<<s.top()<<" ";
        s.pop();
    }
}