#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

vector <int> graf[50010];
int sol[50010],k=1;
bool viz[50010];
void dfs(int nod)
{
    viz[nod]=1;
    for(auto i : graf[nod])
        if(!viz[i])
        {
            sol[k++]=i;
            dfs(i);
        }

}

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n,m,a,b;
    in>>n>>m;
    while(m--)
    {
        in>>a>>b;
        graf[a].push_back(b);
    }
    sol[k++]=1;
    dfs(1);
for(int i=1;i<=n;i++)
out<<sol[i]<<" ";
    return 0;
}