#include <bits/stdc++.h>
using namespace std;
const int maxn = 2500007;
int head[maxn], sum;
struct EDGE {
  int to;
  int next;
  int from;
} edge[maxn];
void add(int x, int y) {
  edge[++sum].next = head[x];
  edge[sum].from = x;
  edge[sum].to = y;
  head[x] = sum;
}
int n, m, x, y, tot;
int in[maxn], ans[maxn];
void topu() {
  priority_queue<int> q;
  for (int i = 1; i <= n; ++i)
    if (in[i] == 0) q.push(i);
  while (!q.empty()) {
    int k = q.top();
    q.pop();
    ans[k] = tot--;
    for (int i = head[k]; i; i = edge[i].next) {
      int v = edge[i].to;
      in[v]--;
      if (in[v] == 0) q.push(v);
    }
  }
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < m; ++i) {
    scanf("%d%d", &x, &y);
    add(y, x);
    in[x]++;
  }
  tot = n;
  topu();
  for (int i = 1; i <= n; ++i) printf("%d ", ans[i]);
}
