program sortare_topologica;
var f,g:text;
    n,m,i,nr,x,y:longint;
    viz:array of longint;
    a:array of array of longint;
    solutie:array of longint;

procedure dfs (i:longint);
var j:longint;
begin
 viz[i]:=1;
 for j:=1 to a[i,0] do
  if viz[a[i,j]]=0 then
   dfs(a[i,j]);
  nr:=nr+1; solutie[nr]:=i;
end;

begin
 assign (f,'sortaret.in'); reset (f);
 assign (g,'sortaret.out'); rewrite (G);
 readln (f,n,m);
 setlength (a,n+1,1);
 setlength (viz,n+1); setlength (solutie,n+1);
 for i:=1 to m do
 begin
  readln (f,x,y);
  setlength (a[x],length (a[x])+1);
  a[x,0]:=a[x,0]+1;
  a[x,a[x,0]]:=y;
 end;
 nr:=0;
 for i:=1 to n do
  if viz[i]=0 then
   dfs(i);
for i:=n downto 1 do
 write (g,solutie[i],' ');
 close (F); close (G);
end.