#include <bits/stdc++.h>

using namespace std;

int t;

const int MAXN = 5000;

vector <int> gr[MAXN + 1];

int viz[MAXN + 1], f[MAXN + 1], sol[MAXN + 1];

void dfs (int tata) {
  viz[tata] = 1;
  for (unsigned i = 0; i < gr[tata].size(); i++) {
    int fiu = gr[tata][i];
    if (viz[fiu] == 0) {
      dfs (fiu);
    }
  }
  t++;
  f[tata] = t;
}

int main() {
  FILE *fin, *fout;
  int n, m, i, x, y;
  fin = fopen ("sortaret.in", "r");
  fout = fopen ("sortaret.out", "w");
  fscanf (fin, "%d%d", &n, &m);
  for (i = 1; i <= n; i++) {
    fscanf (fin, "%d%d", &x, &y);
    gr[x].push_back(y);
  }
  for (i = 1; i <= n; i++) {
    if (viz[i] == 0)
      dfs (i);
  }
  for (i = 1; i <= n; i++) {
    sol[n + 1 - f[i]] = i;
  }
  for (i = 1; i <= n; i++) {
    fprintf (fout, "%d ", sol[i]);
  }
  fclose (fin);
  fclose (fout);
  return 0;
}