#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <vector>
#include <queue>
using namespace std;
FILE *fin,*fout;

vector <int> graf[500005];
queue <int> q;
int varf[500005];

void Topo(){
  int node;
  while(!q.empty()){
    node=q.front();
    q.pop();
    fprintf(fout,"%d ",node);
    for(int neigh : graf[node]){
      varf[neigh]--;
      if(varf[neigh]==0){
        q.push(neigh);
      }
    }
  }
}

int main(){
  int n,m,i,x,y;
  fin=fopen("sortaret.in","r");
  fout=fopen("sortaret.out","w");
  fscanf(fin,"%d%d",&n,&m);

  for(i=0;i<m;i++){
    fscanf(fin,"%d%d",&x,&y);
    varf[y]++;
    graf[x].push_back(y);
  }
  for(i=1;i<=n;i++){
    if(varf[i]==0){
      q.push(i);
    }
  }
  Topo();

  fclose(fin);
  fclose(fout);
  return 0;
}