#include <fstream>
#include <vector>
#include <stack>
#define nmax 50004
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
 
int n,m,x,y;
bool seen[nmax];
vector <int> G[nmax];
stack <int> s;
 
void dfs (int node)
{
    seen[node]=1;
    for (auto ne:G[node])
        if (!seen[ne]) dfs(ne);
    s.push(node);
}
 
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 (!seen[i]) dfs(i);
    while (!s.empty())
    {
        g<<s.top()<<' ';
        s.pop();
    }
    f.close();
    g.close();
    return 0;
}