#include <fstream>
#include <vector>

#define NMAX 50005

using namespace std;

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

int n, m, x, y;
bool viz[NMAX];
vector <int> neighbours[NMAX], answer;

void DFS(int node) {
    viz[node] = true;

    for (auto neighbour : neighbours[node]) {

        if (!viz[neighbour])
            DFS(neighbour);
    }

    answer.push_back(node);
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        f >> x >> y;

        neighbours[x].push_back(y);
    }

    for (int i =1; i <= n; i++) {

        if (!viz[i])
            DFS(i);
    }

    for (int i = answer.size() - 1; i >= 0; i--)
        g << answer[i] << " ";
    g << "\n";

    return 0;
}