#include <fstream>
#include <stack>
#include <vector>
using namespace std;
int n,m,s,viz[50005];
stack < int > q;
vector < int > g[50005];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void citire()
{
    int x, y;
    fin>>n>>m;
    for(int i=0; i<m; i++)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void dfs(int x)
{
    viz[x]=1;
    for (auto &v:g[x])
    {
        if (viz[v]==0)
            dfs(v);
    }
    q.push(x);
}
int main()
{
    citire();
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    while(!q.empty())
    {
        fout<<q.top()<<' ';
        q.pop();
    }
    return 0;
}