#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

vector < int > neigh[50002], sol;
bool state[50002];

void dfs(int node) {
    if(state[node] == 1)
        return;
    state[node] = 1;
    for(int i = 0; i < neigh[node].size(); i++)
        dfs(neigh[node][i]);
    sol.push_back(node);
}

int main() {
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    int n, m; f >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y; f >> x >> y;
        neigh[x].push_back(y);
    }

    for(int i = 1; i <= n; i++)
        dfs(i);
    
    for(int i = sol.size() - 1; i >= 0; i--)
        g << sol[i] << ' ';
    g << '\n';
    f.close();
    g.close();
}