var n,m,i,j,k:longint; r:boolean;
    a,b,c,d:array[1..100000] of longint;
    
begin
  assign(input,'sortaret.in');
  assign(output,'sortaret.out');
  reset(input);
  rewrite(output);
  read(n,m);
  for i:=1 to m do 
    read(a[i],b[i]);
  for i:=1 to n do begin
    d[i]:=i;
  end;
  r:=true;
  while r do begin
    r:=false;
    for i:=1 to m do begin
      if d[a[i]]>d[b[i]] then begin
        r:=true;
        k:=d[a[i]];
        d[a[i]]:=d[b[i]];
        d[b[i]]:=k;
      end;
    end;
  end;
  for i:=1 to n do  
    c[d[i]]:=i;
  for i:=1 to n do
    write(c[i],' ');
end.