#include <cstdio>
#include <vector>
using namespace std;

vector<int>G[50010];
int m, n, i, x, y, k, j, ap[50010], sol[50010], p[50010];

int a()
{
    for (int i=1; i<=n; i++)
        if (ap[i]==0) return 0;
    return 1;
}

void dfs(int x)
{
    ap[x]=1;
    for (int i=0; i<G[x].size(); i++)
        if (ap[G[x][i]]==0) dfs(G[x][i]);
    sol[++k]=x;
}

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);
        p[y]=1;
    }

    for (i=1; i<=n; i++)
        if (p[i]==0) dfs(i);

    for (i=k; i>0; i--) printf("%d ", sol[i]);
    return 0;
}