#include <stdio.h>
#include <vector>
#include <algorithm>

const int MAXN = 5e5;
std::vector<int> adj[MAXN];
bool viz[MAXN];

std::vector<int> topo;
void dfs( int u ) {
  viz[u] = true;
  for( int v : adj[u] )
    if( !viz[v] )
      dfs( v );

  topo.push_back( u );
}

int main() {
  FILE *fin = fopen( "sortaret.in", "r" );
  FILE *fout = fopen( "sortaret.out", "w" );

  int n, m;
  fscanf( fin, "%d%d", &n, &m );
  for( int i = 0; i < m; i++ ){
    int a, b;
    fscanf( fin, "%d%d", &a, &b );
    a--; b--;
    adj[a].push_back( b );
  }

  for( int i = 0; i < n; i++ )
    if( !viz[i] )
      dfs( i );

  std::reverse( topo.begin(), topo.end() );
  for( int x : topo )
    fprintf( fout, "%d ", x + 1 );

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