#include <bits/stdc++.h>
using namespace std;
int n, m;
int u, v;
int t;
map<int, bool> g;
int pos[33000], val[33000];
void work(int id) {
  int k1, k2;
  k1 = pos[id];
  k2 = k1 + 1;
  if (k1 == n) return;
  t = 30001 * val[k1] + val[k2];
  if (!g[t]) return;
  swap(val[k1], val[k2]);
  pos[val[k1]] = k1;
  pos[val[k2]] = k2;
  work(id);
  if (k1 != 1) work(val[k1 - 1]);
}
int main() {
  while (~scanf("%d%d", &n, &m)) {
    g.clear();
    for (int i = 0; i < m; i++) {
      scanf("%d%d", &u, &v);
      t = 30001 * u + v;
      g[t] = true;
      ;
    }
    for (int i = 1; i <= n; i++) pos[i] = val[i] = i;
    for (int i = 1; i <= n; i++) {
      work(i);
    }
    for (int i = 1; i <= n; i++) printf("%d ", val[i]);
    puts("");
  }
  return 0;
}
