#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

#define Nmax 100005

using namespace std;

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

int N, M;
bool vizitat[Nmax];
int sortaret[Nmax], nr;

class Graf{
private:
    int Nr_Noduri, Nr_Muchii;
    vector<int> matrice_adiacenta[Nmax];
    // vector<int> muchii[Nmax], muchiit[Nmax];

public:
    Graf(int N, int M); // constructor
    /*
    vector < vector<int> > getMatriceAdiacenta()
    {
        return matrice_adiacenta;
    }
    */
    void Citire_Graf_Orientat();
    void DFS(int nod);
    void Sortare_Topologica();
};

// constructor
Graf :: Graf(int N, int M)
{
    Nr_Noduri = N;
    Nr_Muchii = M;
    // matrice_adiacenta = matrice;
}

void Graf :: Citire_Graf_Orientat()
{
    for ( int i = 1; i <= Nr_Muchii; i++ )
    {
        int x, y;
        fin >> x >> y;
        matrice_adiacenta[x].push_back(y);
    }
}

void Graf :: DFS(int nod)
{
    vizitat[nod] = 1;

    for ( auto i : matrice_adiacenta[nod] )
        if ( vizitat[i] == 0 )
            DFS(i);

    sortaret[++nr] = nod;    
}

void Graf :: Sortare_Topologica()
{
    for ( int i = 1; i <= Nr_Noduri; i++ )
        if ( vizitat[i] == 0 ) DFS(i);
    for ( int i = Nr_Noduri; i >= 1; i-- )
        fout << sortaret[i] << " ";
    fout << "\n";
}

int main()
{
    fin >> N >> M;
    Graf G(N, M);
    G.Citire_Graf_Orientat();
    G.Sortare_Topologica();

    return 0;
}