#include <iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
using namespace std;
vector<int> v[50005];
bool viz[50005];

struct tmp{
  int t,nr;
};
tmp t[50005];
int timp;
bool cmp(tmp a,tmp b){
  return a.t>b.t;
}
void dfs(int x){
  viz[x]=true;
  for(int i=0;i<v[x].size();i++){
    if(viz[v[x][i]]==false){
      dfs(v[x][i]);
    }
  }
  t[x].t=++timp;
  t[x].nr=x;
}
int main()
{
    FILE*fin,*fout;
    fin=fopen("sortaret.in","r");
    fout=fopen("sortaret.out","w");
    int x1,x2,n,m,i,j;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
      fscanf(fin,"%d%d",&x1,&x2);
      v[x1].push_back(x2);
    }
    for(i=1;i<=n;i++){
      if(viz[i]==false){
        dfs(i);
      }
    }
    sort(t+1,t+n+1,cmp);
    for(i=1;i<=n;i++){
      fprintf(fout,"%d ",t[i].nr);
    }
    return 0;
}