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

using namespace std;

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

constexpr size_t LIM = 5 * 1e4 + 1;
int N, M, node1, node2;
vector<int> adj_list[LIM];
bool visited[LIM];

static inline void dfs(int node, vector<int>& ans) {
    visited[node] = true;
    for (const int adj : adj_list[node])
        if (!visited[adj]) dfs(adj, ans);
    ans.push_back(node);
}

static inline vector<int> topological_ordering() {
    vector<int> ans;
    for (int i = 1; i <= N; ++i)
        if (!visited[i]) dfs(i, ans);
    reverse(ans.begin(), ans.end());
    return ans;
}

int main() {
    fin >> N >> M;
    for (int i = 1; i <= M; ++i) {
        fin >> node1 >> node2;
        adj_list[node1].push_back(node2);
    }

    vector<int> ans = topological_ordering();

    for (const int node : ans)
        fout << node << ' ';

    fin.close();
    fout.close();
    return 0;
}