#include <bits/stdc++.h>
using namespace std;
int n, m, v, u, total, k;
int ggraph[100005], ans[100005], llabel[100005], vvertex[100005], a[100005];
priority_queue<int> q;
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &v, &u);
    ggraph[v]++;
    total++;
    a[total] = v;
    vvertex[total] = llabel[u];
    llabel[u] = total;
  }
  for (int i = 1; i <= n; i++) {
    if (ggraph[i] == 0) q.push(i);
  }
  k = n;
  while (q.size()) {
    v = q.top();
    q.pop();
    ans[v] = k;
    k--;
    for (int i = llabel[v]; i; i = vvertex[i]) {
      u = a[i];
      if (ggraph[u] > 0) ggraph[u]--;
      if (ggraph[u] == 0) q.push(u);
    }
  }
  for (int i = 1; i <= n; i++) {
    printf("%d", ans[i]);
    if (i < n) printf(" ");
  }
  return 0;
}
