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 long long mod = 1e9 + 7;
const double eps = 1e-9;
vector<int> mapp[100010];
int n, m, ans;
int in[100010], num[100010];
void init() {
  for (int i = 0; i <= n; i++) {
    mapp[i].clear();
  }
  memset(in, 0, sizeof(in));
  ans = n;
}
void topu() {
  int vis[100010];
  memset(vis, false, sizeof(vis));
  priority_queue<int> q;
  for (int i = 1; i <= n; i++) {
    if (in[i] == 0) {
      q.push(i);
      vis[i] = true;
    }
  }
  while (!q.empty()) {
    int x = q.top();
    q.pop();
    num[x] = ans--;
    for (int i = 0; i < mapp[x].size(); i++) {
      int y = mapp[x][i];
      if (vis[y]) {
        continue;
      }
      in[y]--;
      if (in[y] == 0) {
        q.push(y);
        vis[y] = true;
      }
    }
  }
}
int main() {
  cin.sync_with_stdio(false);
  int a, b;
  while (cin >> n >> m) {
    init();
    for (int i = 0; i < m; i++) {
      cin >> a >> b;
      mapp[b].push_back(a);
      in[a]++;
    }
    topu();
    for (int i = 1; i <= n; i++) {
      cout << num[i] << " ";
    }
    cout << endl;
  }
  return 0;
}
