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

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int N, M, x, y, viz[50005];
vector < int > G[50005], sol;

inline void dfs(int nod)
{
    for (auto it : G[nod])
        if (!viz[it]) dfs(it);
    sol.push_back(nod);
}

int main()
{
    f>>N>>M;
    for (int i=1; i<=M; ++i)
        f>>x>>y, G[x].push_back(y);

    for (int i=1; i<=N; ++i)
        if (!viz[i]) dfs(i);
    for (int i=sol.size()-1; i>=0; --i)
        g<<sol[i]<<' '; g<<'\n';
    return 0;
}