#include <bits/stdc++.h>
using namespace std;
ifstream f ("sortaret.in") ;
ofstream g ("sortaret.out") ;
vector <int> v[50005] , sol ;
bool viz[50005] ;
int N , M , x , y;
void DFS (int nod)
{
    viz[nod] = true;
    int len = v[nod].size() ;
    for (int i = 0 ; i < len ; ++i)
    {
        int vec = v[nod][i];
        if (!viz[vec]) DFS(vec);
    }
     sol.push_back(nod) ;
}
void afis()
{
    for (int i = sol.size() - 1 ; i >= 0 ; --i) g << sol.at(i) << ' ' ;

    f.close();
    g.close();
    return ;
}
int main()
{
    f >> N >> M  ;
    for (int i = 1 ; i <= M ; ++i)
    {
        f >> x >> y ;
        v[x].push_back(y) ;
    }

    for (int nod = 1 ; nod <= N ; ++nod)
        if (!viz[nod]) DFS(nod) ;

    afis();

}