#include <bits/stdc++.h>
int II() {
  int n;
  scanf("%d", &n);
  return n;
}
void IIb(int n) { printf("%d ", n); }
constexpr int MAXN = 100000;
std::vector<int> in_adj[MAXN];
int out_degree[MAXN];
int ans[MAXN];
int main() {
  int N = II(), M = II(), f = N;
  while (M--) {
    int u = II() - 1, v = II() - 1;
    in_adj[v].push_back(u);
    ++out_degree[u];
  }
  std::priority_queue<int> pq;
  for (int u = 0; u < N; ++u)
    if (!out_degree[u]) pq.push(u);
  while (!pq.empty()) {
    int u = pq.top();
    pq.pop();
    ans[u] = f--;
    for (int v : in_adj[u])
      if (!--out_degree[v]) pq.push(v);
  }
  for (int u = 0; u < N; ++u) IIb(ans[u]);
  putchar(10);
}
