#include <fstream>
#include <vector>
#include <queue>
using namespace std;

int num_nodes,num_edges;
vector<vector<int>> adj(50001);
vector<int> visited(50001);
vector<int> sorted;

void dfs(int node) {
    visited[node]=1;
    for(auto next:adj[node])
        if(not visited[next])
            dfs(next);
    sorted.push_back(node);
}

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

    fin>>num_nodes>>num_edges;
    for(int i=1; i<=num_edges; i++) {
        int src,dest;
        fin>>src>>dest;
        adj[src].push_back(dest);
    }

    for(int i=1; i<=num_nodes; i++)
        if(not visited[i])
            dfs(i);

    for(auto it:sorted)
        fout<<it<<' ';

    return 0;
}