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

using namespace std;

int m,n;
int i,j;
vector< vector<int> > graph;
vector<bool> visited;
stack<int> result;

void dfs(int vertex){

    if(vertex<0 || vertex>n-1){
        return;
    }
    stack<int> s;
    int element;
    bool found;
    s.push(vertex);
    visited[vertex]=1;
    while(!s.empty()){
        element=s.top();
        found=false;
        for(i=0;i<graph[element].size() && !found;i++){
            if(!visited[graph[element][i]]){
                found=true;
            }
        }
        if(found){
            i--;
            s.push(graph[element][i]);
            visited[graph[element][i]]=true;
        }else{
            result.push(s.top()+1);
            s.pop();

        }
    }


}

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    graph.resize(n);
    visited.resize(n,false);
    int x,y;
    for(int i=0;i<m;i++){
        f>>x>>y;
        x--;
        y--;
        graph[x].push_back(y);
    }
    for(int i=0;i<visited.size();i++){
        if(!visited[i]){
            dfs(i);
        }
    }
    while(!result.empty()){
        g<<result.top()<<" ";
        result.pop();
    }
    f.close();
    g.close();
    return 0;
}