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


using namespace std;
stack<int> st;
vector<bool> vis;
vector<int> degs;
vector<int> ord;
vector<vector<int>> arcs;

void dfs()
{
    int x = st.top();

    if(degs[x] == 0)
        ord.push_back(x);

    if(!vis[x])
        for(int i=0; i<arcs[x].size(); ++i)
        {
            --degs[arcs[x][i]];
            st.push(arcs[x][i]);
            dfs();
            st.pop();
        }

    vis[x] = 1;
}

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

    int n, m, x, y, i;
    scanf("%d%d", &n, &m);
    arcs.resize(n+1);
    degs.assign(n+1, 0);
    vis.assign(n+1, 0);

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

    for(i=1; i<=n; ++i)
        if(degs[i] == 0 && vis[i] == 0)
        {
            st.push(i);
            dfs();
        }

    for(i=0; i<n; ++i)
        printf("%d ", ord[i]);

    fclose(stdin);
    fclose(stdout);
    return 0;
}