#include <iostream>
#include <vector>

#define MAXN 50000
using namespace std;

FILE *fin, *fout;

struct node{
  bool visited;
  vector <int> edges;
};

node tree[MAXN];

void addEdge(int a, int b) {
  tree[a].edges.push_back(b);
}

void dfs(int pos) {
  tree[pos].visited = true;

  for ( int i : tree[pos].edges ) {
    fprintf(fout, "%d ", i);
    if ( !tree[i].visited )
      dfs(i);
  }
}

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

  int n, m, i, a, b;

  fscanf(fin, "%d%d", &n, &m);

  for ( i = 0; i < m; i++ ) {
    fscanf(fin, "%d%d", &a, &b);

    addEdge(a, b);
  }

  for ( i = 1; i <= n; i++ ) {
    if ( !tree[i].visited ) {
      fprintf(fout, "%d ", i);
      dfs(i);
    }
  }

  fclose(fin);
  fclose(fout);

  return 0;
}