#include <bits/stdc++.h>

using namespace std;

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

int n, m;
vector <int> g[50005];
stack <int> st;
int viz[50005];

inline void dfs(int nod)
{
    viz[nod] = 1;
    for (auto fiu : g[nod])
    {
        if (viz[fiu])
            continue;
        dfs(fiu);
    }
    st.push(nod);
}

int main()
{
    fin >> n >> m;
    while (m--)
    {
        int a, b;
        fin >> a >> b;
        g[a].push_back(b);
    }
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            dfs(i);
    while (!st.empty())
        fout << st.top() << " ", st.pop();
    return 0;
}