# include <bits/stdc++.h>

using namespace std;

const int Nmax = 50000 + 5;

int m, x, y, n, sol[Nmax], N = 0;
bool ap[Nmax];

vector <int> G[Nmax];

void read()
{
    for (int i = 1; i <= m; ++i)
    {
        scanf("%d %d", &x, &y);
        G[x].push_back(y);
    }

}

void DFS(int node) {

    ap[node] = true;

    for (int i = 0; i < G[node].size(); ++i)
        if (!ap[G[node][i]]) DFS(G[node][i]);

    sol[++N] = node;

}
int main ()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    scanf("%d %d\n", &n, &m);

    read();

    memset(ap, false, sizeof(ap));

    for (int i = 1; i <= n; ++i)
        if (!ap[i]) DFS(i);

    for (int i = N; i >= 1; --i)
        printf("%d ", sol[i]);

    printf("\n");

    return 0;
}