#include<fstream>
#include<vector>
using namespace std;
int main()
{
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector<int> graph[50001];
int n,i,j,x,y,m,grad_int[50001],sort[50001],pos=0;
in>>n>>m;
for(i=1;i<=m;i++)
{
in>>x>>y;
graph[x].push_back(y);
grad_int[y]++;
}
for(i=1;i<=n;i++)
 if(grad_int[i]==0)  sort[++pos]=i;

for(i=1;i<=n;i++)
{
  x=sort[i];
     for(j=0;j<graph[x].size();j++)
	 {
	     grad_int[graph[x][j]]--;
         if(grad_int[graph[x][j]]==0) sort[++pos]=graph[x][j];
	 }    
}

for(i=1;i<=n;i++)
	out<<sort[i]<<" ";

return 0;
}