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

    }
}

int main()
{f>>n>>m;

graph.resize(n);
visited.resize(n,false);
int x,y,i;
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])
        dfs(i);
    }
i=0;
vector <int> t;
t.resize(n);
while(!sortt.empty())
    {
    t[i]=sortt.top()+1;
    i++;
    sortt.pop();
    }
for(i=n-1;i>=0;i--)
    g<<t[i]<<" ";


f.close();
g.close();
    return 0;
}