#include <fstream>
#include <vector>
using namespace std;

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

#define NMAX 50005

vector<int> g[NMAX];

int v[NMAX], viz[NMAX], k;

void dfs(int nod)
{
    viz[nod] = 1;

    for (auto it : g[nod])
        if (!viz[it])
            dfs(it);

    v[++ k] = nod;
}

int main()
{
    int n, m;
    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 (!viz[i])
            dfs(i);

    for (int i = n; i >= 1; -- i)
        fout << v[i] << ' ';
    return 0;
}