#include <bits/stdc++.h>
using namespace std;

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

int n, m;
vector<vector<int>> ad;

vector<int> topo;
vector<bool> vis;

void dfs(int node) {
    vis[node] = true;
    for (int nghb : ad[node])
        if (!vis[nghb])
            dfs(nghb);
    topo.push_back(node);
}

int main() {
    fin >> n >> m;
    ad.resize(n + 1);
    for (int i = 0; i < m; i++) {
        int x, y; fin >> x >> y;
        ad[x].push_back(y);
    }

    vis.resize(n + 1);
    for (int i = 1; i <= n; i++)
        if (!vis[i])
            dfs(i);

    for (int i = n - 1; i >= 0; i--)
        fout << topo[i] << ' ';
    fout << '\n';

    fout.close();
    return 0;
}