#include <bits/stdc++.h>
using namespace std;
int n, m;
int deg[100001];
vector<int> gra[100001];
int ans[100001];
void topsort() {
  memset(ans, 0, sizeof(ans));
  priority_queue<int, vector<int>, less<int> > q;
  int cnt = n;
  for (int i = 1; i <= n; i++)
    if (deg[i] == 0) {
      q.push(i);
    }
  while (!q.empty()) {
    int h = q.top();
    q.pop();
    ans[h] = cnt--;
    if (gra[h].size() == 0) continue;
    for (int i = 0; i < gra[h].size(); i++) {
      if (--deg[gra[h][i]] == 0) q.push(gra[h][i]);
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  while (cin >> n >> m) {
    memset(gra, 0, sizeof(gra));
    memset(deg, 0, sizeof(deg));
    for (int i = 1; i <= n; i++) gra[i].clear();
    for (int i = 0; i < m; i++) {
      int a, b;
      cin >> a >> b;
      gra[b].push_back(a);
      deg[a]++;
    }
    topsort();
    for (int i = 1; i <= n; i++)
      if (i != n)
        cout << ans[i] << " ";
      else
        cout << ans[i] << endl;
  }
  return 0;
}
