#include <fstream>
#include <vector>
#include <stack>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMAX = 50000;

int N, M;
vector <int> g[NMAX + 5];

bool vis[NMAX + 5];
stack <int> st;

void dfs(int node)
{
    vis[node] = 1;

    for(auto it : g[node])
        if(!vis[it])
            dfs(it);

    st.push(node);
}

int main()
{
    fin >> N >> M;

    for(int i = 1; i <= M; i++) {

        int x, y;
        fin >> x >> y;
        g[x].push_back(y);

    }

    for(int i = 1; i <= N; i++)
        if(!vis[i])
            dfs(i);

    while(!st.empty()) {

        fout << st.top() << '\n';
        st.pop();

    }

    return 0;
}