#include <iostream>
#include <fstream>
#include <vector>
#define limit 50100
using namespace std;
int n,m,a,b;
vector <int>G[limit];
int k=0;
int grad[limit]{};
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int solutie[limit]{};
void citire(){
fin>>n>>m;
for(int i=1;i<=m;i++){
        fin>>a>>b;
    G[a].push_back(b);
    grad[b]++;
}
}
void sortarerecursiva(int a){
solutie[++k]=a;
int x=G[a].size();
        for(int j=0;j<x;j++){
   grad[G[a][j]]--;
  if(grad[G[a][j]]==0){
    sortarerecursiva(G[a][j]);
  }
        }

    }


int main()
{citire();
int x=0;
for(int i=1;i<=n;i++){
    if(grad[i]==0){
        x=i;
    }
}
sortarerecursiva(x);
for(int i=1;i<=n;i++){
    fout<<solutie[i]<<" ";
}
fin.close();
fout.close();
    return 0;
}