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

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

vector <int> graph[50001];
// graph[1] - lista vecinilor nodului 1
// graph[1][0], graph[1][1], graph[1][2] etc. - vecinii nodului 1

bool visited[50001];

vector <int> sol;

void dfs(int node) {
    visited[node] = true;

    // parcurg vecinii nodului node
    for (int i = 0; i < graph[node].size(); i++) {
        int y = graph[node][i];
        if (!visited[y]) {
            dfs(y);
        }
    }

    sol.push_back(node); // sortare topologica
}

int main()
{
    int n, m, x, y, i;

    in >> n; // numarul de noduri
    in >> m; // numarul de arce

    for (i = 1; i <= m; i++) {
        in >> x >> y;
        graph[x].push_back(y);
    }

    for (i = 1; i <= n; i++) {
        if (!visited[i]) {
            dfs(i);
        }
    }

    for (i = sol.size() - 1; i >= 0; i--) {
        out << sol[i] << " ";
    }

    return 0;
}