#include <fstream>
#include <vector>
#include <set>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, x, y, i;
vector <set <int> > g;
vector <int> st, viz;
void dfs (int start)
{
    viz[start] = 1;
    for (auto it : g[start])
    {
        if (viz[it] == 0)
            dfs(it);
    }
    st.push_back(start);
}
int main()
{
    fin >> n >> m; g.resize(n+1); viz.resize(n+1);
    for (i = 1; i <= m; i++)
    {
        fin >> x >> y;
        if (g[x].find(y) == g[x].end()) g[x].insert(y);
    }
    for (i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
            dfs(i);
    }
    for (auto it = st.rbegin(); it != st.rend(); it++)
        fout << *it << ' ';
    return 0;
}