#include <iostream>
#include <fstream>
#include <vector>
#include <stack>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");

int vizitat[50003];
vector <int> myGraph[50003];
stack <int> myStack;

void dfs(int nod)
{
    vizitat[nod]=1;
    int lim=myGraph[nod].size();
    for(int i=0;i<lim;i++)
        if(vizitat[myGraph[nod][i]]==0)
        dfs(myGraph[nod][i]);
    myStack.push(nod);
}

int main()
{int n,m,i,x,y;
in>>n>>m;
for(i=1;i<=m;i++)
{
    in>>x>>y;
    myGraph[x].push_back(y);
}
    for(i=1;i<=n;i++)
        if(vizitat[i]==0)
        dfs(i);
    for(i=0;i<n;i++)
    {
        out<<myStack.top()<<" ";
        myStack.pop();
    }
    return 0;
}