#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<vector<int> > grafo;
vector<int> indegre;
int main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> m;
  grafo.resize(n, vector<int>());
  indegre.resize(n, 0);
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    u--;
    v--;
    grafo[v].push_back(u);
    indegre[u]++;
  }
  priority_queue<int> S;
  for (int i = 0; i < n; i++) {
    if (indegre[i] == 0) {
      S.push(i);
    }
  }
  vector<int> L;
  L.resize(n, 0);
  int pos = n - 1;
  while (S.size() != 0) {
    int v = S.top();
    S.pop();
    L[v] = pos;
    for (int w = 0; w < grafo[v].size(); w++) {
      int vecino = grafo[v][w];
      indegre[vecino]--;
      if (indegre[vecino] == 0) {
        S.push(vecino);
      }
    }
    pos--;
  }
  for (int i = 0; i < n; i++) {
    cout << L[i] + 1 << " ";
  }
  cout << "\n";
}
