#include<fstream>
#include<vector>

#define Nmax 50010

using namespace std;

int n, m, w[Nmax], nr, viz[Nmax], x, y;

vector <int> muchie[Nmax];

void dfs (int nod)
{
    for (int j = 0; j < muchie[nod].size(); ++j)
        if (!viz[muchie[nod][j]])
        {
            viz[muchie[nod][j]] = 1;
            dfs(muchie[nod][j]);
        }
    ++nr;
    w[n + 1 - nr] = nod;
}

int main()
{
    ifstream f ("sortaret.in");
    ofstream h ("sortaret.out");
    f >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        muchie[x].push_back(y);
    }
    f.close();

    for (int i = 1; i <= n; ++i)
        if (!viz[i])
        {
            viz[i] = 1;
            dfs(i);
        }
    for (int i = 1; i <= n; ++i)
        h << w[i] << " ";
    h << '\n';

    h.close();
    return 0;
}