#include<fstream>
#include<vector>
#include<list>
#define nmax 50005
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n,m,viz[nmax];
vector <int> G[nmax];
list <int> Lista; // lista varfurilor sortate topologic

void Citire()
{
    int i,j;
    fin>>n>>m;
    while(m--)
    {
        fin>>i>>j;
        G[i].push_back(j);
    }
}

void DFS(int nod)
{
    viz[nod]=1;
    Lista.push_back(nod);
    for(unsigned i = 0; i < G[nod].size(); i++)
    {
        int vecin = G[nod][i];
        if(!viz[vecin])
            DFS(vecin);
    }
}

void Afisare()
{
    list <int>::iterator it;
    for(it = Lista.begin(); it != Lista.end(); ++it)
        fout<<*it<<' ';
    fout<<'\n';
}
int main()
{
    Citire();
    DFS(1);
    Afisare();
    return 0;
}