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

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

int n, m;
vector<int> v[50005];
bool viz[50005];
vector<int> sol;

void dfs(int nod) {
    viz[nod] = true;
    for (auto vec : v[nod])
        if (!viz[vec])
            dfs(vec);
    sol.push_back(nod);
}

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b;
        fin >> a >> b;
        v[a].push_back(b);
    }

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

    reverse(sol.begin(), sol.end()); 

    for (auto x : sol)
        fout << x << " ";

    return 0;
}