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


using namespace std;

void dfs(stack<int> st, list<int> ord, vector<int> degs, vector<vector<int>> arcs)
{
    int x = st.top();

    for(int i=0; i<arcs[x].size(); ++i)
    {
        --degs[arcs[x][i]];
        st.push(arcs[x][i]);
        if(degs[arcs[x][i]] == 0)
        {
            printf("%d ", arcs[x][i]);
            degs[arcs[x][i]] = -1;
        }
        dfs(st, ord, degs, arcs);
        st.pop();
    }
}

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

    int n, m, x, y, i;
    scanf("%d%d", &n, &m);
    vector<vector<int>> arcs(n+1);
    vector<int> degs(n+1, 0);
    list<int> ord;

    stack<int> st;

    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)
        {
            st.push(i);
            printf("%d ", i);
            dfs(st, ord, degs, arcs);
        }

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