#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMax = 100005;
int N,M,K,Use[NMax],O[NMax];
vector <int> G[NMax];

void Read()
{
  fin>>N>>M;
  for(int i=1; i<=M;++i)
    {
      int x,y;
      fin>>x>>y;
      G[x].push_back(y);
    }
}

void DFS(int Nod)
{
  Use[Nod]=1;
  for(int i=0; i<(int)G[Nod].size();++i)
    {
      int Vecin=G[Nod][i];
      if(!Use[Vecin])
        DFS(Vecin);
    }
  O[++K]=Nod;
}

int main()
{
    Read();
    for(int i=1; i<=N; ++i)
      if(!Use[i])
        DFS(i);
    for(int i=K; i>=1;--i)
      fout<<O[i]<<" ";
    fout<<"\n";
    return 0;
}