#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m;
vector<vector<int> > graph;
vector<bool> visited;
stack<int> sortaret;
void sortare_top_dfs(int vertex)
{
    if(vertex<0 || vertex>n-1) return;
    stack<int> s;
    int element,i,vf;
    bool found;
    s.push(vertex);
    visited[vertex]=true;
    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
            {
                vf=s.top();
                sortaret.push(vf);
                s.pop();
            }

    }
}
int main()
{

    f>>n>>m;
    int i;
    graph.resize(n);
    visited.resize(n,false);
    int x,y;
    for( i=0; i<m; i++)
    {
        f>>x>>y;
        x--;
        y--;
        graph[x].push_back(y);
    }

    for(i=0; i<n; i++)
        if(!visited[i])
            sortare_top_dfs(i);
    while(!sortaret.empty())
    {
        g<<sortaret.top()+1<<" ";
        sortaret.pop();
    }
    f.close();
    g.close();
    return 0;
}