#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;

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

void dfs(int x, vector< vector<int> >&G, vector<bool>&viz, stack<int>&top)
{
    vector<int>::iterator i;
    viz[x]=1;
    for (i = G[x].begin(); i != G[x].end(); ++i)
        if(viz[*i]==0)
            dfs(*i,G,viz,top);
    top.push(x);
}
int main()
{
    int n, m,a,b;
    f>>n>>m;
    vector< vector<int> >G(n+1);
    for(int i=0;i<m;i++)
    {
        f>>a>>b;
        G[a].push_back(b);
    }
    vector<bool>viz(n+1,0);
    stack<int>top;
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i,G,viz,top);
    while(!top.empty())
    {
        g<<top.top()<<" ";
        top.pop();
    }
    f.close();
    g.close();

    return 0;
}