#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 5;
vector<vector<int> > adj;
vector<vector<int> > rev;
int indeg[N];
vector<int> topo;
int label[N];
int found[N];
void dfs(int v) {
  found[v] = 1;
  for (int i = 0; i < adj[v].size(); i++) {
    int u = adj[v][i];
    if (found[u] == 1) continue;
    dfs(u);
  }
  topo.push_back(v);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int n, m;
  cin >> n >> m;
  memset(indeg, 0, sizeof(indeg));
  adj.resize(n + 5);
  rev.resize(n + 5);
  for (int i = 1; i <= m; i++) {
    int u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    rev[v].push_back(u);
    indeg[u]++;
  }
  set<int> st;
  for (int i = 1; i <= n; i++)
    if (indeg[i] == 0) st.insert(i);
  while (!st.empty()) {
    set<int>::iterator it = st.end();
    it--;
    int u = (*it);
    topo.push_back(u);
    st.erase(it);
    for (int i = 0; i < rev[u].size(); i++) {
      int v = rev[u][i];
      indeg[v]--;
      if (indeg[v] == 0) st.insert(v);
    }
  }
  reverse(topo.begin(), topo.end());
  for (int i = 0; i < n; i++) {
    label[topo[i]] = i;
  }
  for (int i = 1; i <= n; i++) cout << label[i] + 1 << " ";
  cout << endl;
}
