#include <bits/stdc++.h>
using namespace std;
bool endline = false;
template <class T>
istream& operator>>(istream& inp, vector<T>& v) {
  for (auto& it : v) inp >> it;
  return inp;
}
template <class T>
ostream& operator<<(ostream& out, vector<T>& v) {
  for (auto& it : v) out << it << (endline ? "\n" : " ");
  return out;
}
template <class T, class U>
istream& operator>>(istream& inp, pair<T, U>& v) {
  inp >> v.first >> v.second;
  return inp;
}
template <class T, class U>
ostream& operator<<(ostream& out, pair<T, U>& v) {
  out << v.first << ' ' << v.second;
  return out;
}
void debug() { cout << endl; }
template <typename H, typename... T>
void debug(H a, T... b) {
  cout << a << ' ';
  debug(b...);
}
void FAST_IO(string filein = "", string fileout = "") {
  if (fopen(filein.c_str(), "r")) {
    freopen(filein.c_str(), "r", stdin);
    freopen(fileout.c_str(), "w", stdout);
  }
  cin.tie(0), cout.tie(0)->sync_with_stdio(0);
}
void Hollwo_Pelw();
signed main() {
  FAST_IO(".inp", ".out");
  int testcases = 1;
  for (int test = 1; test <= testcases; test++) {
    Hollwo_Pelw();
  }
  return 0;
}
const int allmod[3] = {(int)1e9 + 7, 998244353, (int)1e9 + 9};
const int mod = allmod[1];
const int MAXN = 3e5 + 5;
const int inf = 2e9;
const long long linf = 1e18;
long long n, m, deg[MAXN], res[MAXN];
vector<long long> adj[MAXN];
priority_queue<long long> pq;
void Hollwo_Pelw() {
  cin >> n >> m;
  for (long long i = 1, u, v; i <= m; i++) {
    cin >> u >> v;
    adj[v].push_back(u);
    deg[u]++;
  }
  for (long long i = 1; i <= n; i++) {
    if (!deg[i]) pq.push(i);
  }
  long long idx = n;
  while (!pq.empty()) {
    long long u = pq.top();
    pq.pop();
    res[u] = idx--;
    for (auto v : adj[u]) {
      deg[v]--;
      if (deg[v] == 0) pq.push(v);
    }
  }
  for (long long i = 1; i <= n; i++) cout << res[i] << ' ';
}
