/* Sortare topologica */
#include <fstream>
#include <vector>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

unsigned int N; long int M; bool Mark[50002];
vector <unsigned int> Tab[50002];

void Citire()
{
    fin>>N>>M; unsigned int x,y;
    while(fin>>x>>y) Tab[x].push_back(y);
}

/* Parcurgere in adancime pentru a calcula timpii de terminare pentru fiecare
varf. Pe masura ce fiecare varf este terminat, acesta este scris sau salvat. */

void DFS(unsigned int Nod)
{
    vector<unsigned int>::iterator it;
    Mark[Nod]=1;

    fout<<Nod<<' ';

    for(it=Tab[Nod].begin(); it!=Tab[Nod].end(); it++)
        if(!Mark[*it])
            DFS(*it);
}

int main()
{
    Citire();
    DFS(1);
}