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

#define MAXN 50001

using namespace std;
using Graph = vector<vector<int> >;

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

int N, M;
Graph G(MAXN);
vector<int> visited(MAXN, 0);
vector<int> sol;

void dfs(int source)
{
    visited[source] = 1;
    for (auto &node : G[source])
        if (!visited[node]) 
            dfs(node);
    sol.push_back(source);
}

int main()
{
    in >> N >> M;

    int x, y;
    for (int i = 1; i <= M; i++) {
        in >> x >> y;
        G[x].push_back(y);
    }

    for (int node = 1; node <= N; node++)
        if (!visited[node])
            dfs(node);

    for (int i = sol.size() - 1; i >= 0; i--)
        out << sol[i] << " ";
    out << '\n';

    return 0;
}