#include <bits/stdc++.h>

using namespace std;

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

const int NM = 1e5 + 6;

vector<int>g[NM], order;
int n, m;
int used[NM];

void dfs (int nod) {
    used[nod] = true;
    for (int u : g[nod]) {
        if (!used[u]) {
            dfs(u);
        }
    }
    order.push_back(nod);
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y; fin >> x >> y;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) {
        if (!used[i]) {
            dfs(i);
        }
    }
    reverse(order.begin(), order.end());
    for (int x : order) {
        fout << x << " ";
    }
}