#include <bits/stdc++.h>

using namespace std;

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

vector<vector<int>>g(50001);

stack<int>st;
bitset<50001>vis;

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

    for (int i : g[x])
    {
        if (!vis[i])
            dfs(i);
    }

    st.push(x);
}

int main()
{
    int n, m;
    in >> n >> m;

    while (m--)
    {
        int x, y;
        in >> x >> y;

        g[x].push_back(y);
    }

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

    while (!st.empty())
        out << st.top() << ' ', st.pop();

    return 0;
}