program sortt;
var f,g:text;
n,m,i,j,x,y,nr:longint;
viz,p:array of longint;
a:array of array of longint;
Procedure dfs(nod:longint);
var k:longint;
begin
    viz[nod]:=1;
     for k:=1 to a[nod,0] do
        if viz[a[nod,k]]=0 then
          dfs(a[nod,k]);
        nr:=nr+1;
        p[nr]:=nod;
end;
begin
assign(f,'sortaret.in'); reset(f);
assign(g,'sortaret.out'); rewrite(g);
readln(f,n,m);
setlength(a,n+1,1);
setlength(p,n+1);
setlength(viz,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;
       for i:=1 to n do
         if viz[i]=0 then
           dfs(i);
for i:=n downto 1 do
    write(g,p[i],' ');
close(f);
close(g);
end.