#include <cstdio>
#include <vector>

#define NMAX 50005

using namespace std;

int N, M, sol[NMAX];
bool vizitat[NMAX];
vector <int> G[NMAX];

void citire()
{
    int x, y;

    scanf("%d %d", &N, &M);

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

void DFS(int nod)
{
    vizitat[nod] = true;
    for (vector <int> :: iterator it = G[nod].begin(); it != G[nod].end(); ++it)
    {
        if (vizitat[*it] == false)
            DFS(*it);
    }
    sol[++sol[0]] = nod;
}

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

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

    citire();
    for (int i = 1; i <= N; ++i)
        if (vizitat[i] == false)
            DFS(i);
    afisare();

    return 0;
}