#include <fstream>
#include <vector>
#include <deque>

using namespace std;

int n, m, i, j;
deque<int> sol;
deque<int>::iterator it;
vector<int> v[50005];
vector<bool> viz(50005, false);

void dfs(int nod) {
    int p;

    if(!viz[nod]) {
        viz[nod] = true;
        for(p = 0; p < v[nod].size(); p++)
            if(!viz[v[nod][p]])
                dfs(v[nod][p]);
        sol.push_front(nod);
    }
}

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

    f >> n >> m;
    while(m) {
        f >> i >> j;

        v[i].push_back(j);
        m--;
    }
    f.close();

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

    for(it = sol.begin(); it != sol.end(); it++)
        g << *it << ' ';
    g << '\n';
    g.close();

    return 0;
}