You are given a directed acyclic graph with n vertices and m edges. There are no self-loops or multiple edges between any pair of vertices. Graph can be disconnected.

You should assign labels to all vertices in such a way that:

  * Labels form a valid permutation of length n — an integer sequence such that each integer from 1 to n appears exactly once in it. 
  * If there exists an edge from vertex v to vertex u then labelv should be smaller than labelu. 
  * Permutation should be lexicographically smallest among all suitable. 



Find such sequence of labels to satisfy all the conditions.

Input

The first line contains two integer numbers n, m (2 ≤ n ≤ 105, 1 ≤ m ≤ 105).

Next m lines contain two integer numbers v and u (1 ≤ v, u ≤ n, v ≠ u) — edges of the graph. Edges are directed, graph doesn't contain loops or multiple edges.

Output

Print n numbers — lexicographically smallest correct permutation of labels of vertices.

Examples

Input

3 3
1 2
1 3
3 2


Output

1 3 2 


Input

4 5
3 1
4 1
2 3
3 4
2 4


Output

4 1 2 3 


Input

5 4
3 1
2 1
2 3
4 5


Output

3 1 2 4 5 
#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;
}
