#include <cstdio>
#include <vector>
#include <stack>

#define NMAX 50001

using namespace std;

vector < int > G[NMAX];
stack < int > S;

int n;
bool viz[NMAX];

void read()
{
    int m;
    int x;
    int y;

    freopen("sortaret.in", "r", stdin);

    scanf("%d %d\n", &n, &m);
    while(m --)
    {
        scanf("%d %d\n", &x, &y);
        G[x].push_back(y);
    }
}

void dfs(int nod)
{
    viz[nod] = 1;

    unsigned int m = G[nod].size();
    for(unsigned int i = 0; i < m; ++ i)
        if(!viz[G[nod][i]])
            dfs(G[nod][i]);

    S.push(nod);
}

void solve()
{
    for(int i = 1; i <= n; ++ i)
        if(!viz[i])
            dfs(i);
}

void write()
{
    freopen("sortaret.out", "w", stdout);

    while(!S.empty())
    {
        printf("%d ", S.top());
        S.pop();
    }

    printf("\n");
}

int main()
{
    read();
    solve();
    write();

    return 0;
}