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

#define NMAX 50005

using namespace std;

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

int n, m;
vector<int> edges[NMAX], ans;
bool visited[NMAX];

void dfs(int node) {
    visited[node] = 1;
    for (auto child : edges[node]) {
        if (!visited[child])
            dfs(child);
    }
    ans.push_back(node);
}

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

    for (int i = 0; i < m; i++) {
        int x, y;
        f >> x >> y;
        edges[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        if (!visited[i]) dfs(i);
    
    reverse(ans.begin(), ans.end());
    
    for (auto x : ans) g << x << " ";

    return 0;
}