#include <bits/stdc++.h>
using namespace std;
vector<int> g[101111];
int visited[101111];
int label[101111];
int n;
int outdegree[101111];
int main() {
  int i, m;
  scanf("%d%d", &n, &m);
  priority_queue<int> q;
  for (i = 0; i < m; i++) {
    int v1, v2;
    scanf("%d%d", &v1, &v2);
    g[v2].push_back(v1);
    outdegree[v1]++;
  }
  for (i = 1; i <= n; i++) {
    if (!outdegree[i]) {
      q.push(i);
    }
  }
  int ans = n;
  while (!q.empty()) {
    int v = q.top();
    q.pop();
    if (visited[v]) {
      continue;
    }
    label[v] = ans--;
    visited[v] = 1;
    for (auto nv : g[v]) {
      if (!visited[nv]) {
        outdegree[nv]--;
        if (!outdegree[nv]) {
          q.push(nv);
        }
      }
    }
  }
  for (i = 1; i <= n; i++) {
    printf("%d ", label[i]);
  }
  return 0;
}
