#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

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

int n, m, postordine[50002], nr;
vector <vector<int> > G(50002);
vector <int> viz(50002, 0);
void DFS(int start)
{
    viz[start] = 1;
    for (auto i : G[start])
    {
        if (viz[i] == 0)
            DFS(i);
    }
    postordine[++nr] = start;

}

int main()
{
    f >> n >> m;

    for (int i = i; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        if (!viz[i])
            DFS(i);
    for (int i = 1; i <= n; i++)
        g << postordine[i] << " ";

    return 0;
}