#include <cstdio>
#include <vector>
using namespace std;
vector <int> G[50005];
vector <int> sol;
int n,m,i,x,y,visited[50005];
void dfs(int node)
{
    visited[node]=1;
    for (int i=0; i<G[node].size(); i++)
    {
        int crt=G[node][i];
        if (!visited[crt]) dfs(crt);
    }
    sol.push_back(node);
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    scanf("%d %d",&n,&m);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        G[x].push_back(y);
    }
    for (i=1; i<=n; i++) if (!visited[i]) dfs(i);
    while (!sol.empty())
    {
        printf("%d ",sol.back());
        sol.pop_back();
    }
    return 0;
}