#include <cstdio>
#include <vector>
using namespace std;
vector <int> g[50001];
bool sel[50001];
int q[50001], k;
void dfs (int x)
{
    sel[x]=true;
    for (int i=0; i<g[x].size(); i++)
    {
        if (!sel[g[x][i]]) dfs(g[x][i]);
    }
    q[++k]=x;
}
int main()
{
    int n, m, i, x, y;
    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 (!sel[i])
        {
            dfs(i);
        }
    }
    for (i=k; i>=1; i--) printf("%d ",q[i]);
    return 0;
}