#include <fstream>
#include <stack>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m;
bool viz[50005];
vector <int> G[50005];
stack <int> S;
void dfs(int x)
{
    viz[x]=1;
    for(auto i:G[x])
        if(viz[i]==0)
            dfs(i);
    S.push(x);
}
int main()
{int i,j,x,y;
    cin>>n>>m;
    for( i=1; i<=m; i++)
    {
        cin>>x>>y;
        G[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        if(viz[i]==0)
            dfs(i);
    while(!S.empty())
    {
        cout<<S.top()<<" ";
        S.pop();
    }
    return 0;
}