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>
struct edge {
  int b, ne;
} da[100100];
int head[100100], TOT = 1, du[100100], id[100100];
void insert(int a, int b) {
  da[++TOT] = (edge){b, head[a]};
  head[a] = TOT;
  du[b]++;
}
std::priority_queue<int> heap;
int n, m;
int main() {
  scanf("%d%d", &n, &m);
  memset(head, 0, sizeof head);
  memset(du, 0, sizeof du);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    insert(v, u);
  }
  for (int i = 1; i <= n; i++)
    if (du[i] == 0) heap.push(i);
  int now = n;
  while (!heap.empty()) {
    int x = heap.top();
    heap.pop();
    id[x] = now;
    now--;
    for (int t = head[x]; t; t = da[t].ne) {
      du[da[t].b]--;
      if (du[da[t].b] == 0) heap.push(da[t].b);
    }
  }
  for (int i = 1; i <= n; i++) printf("%d ", id[i]);
  return 0;
}
