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>
template <class T>
struct ptr_min {
  bool operator()(T* a, T* b) { return *a < *b; }
};
template <class T>
struct ptr_max {
  bool operator()(T* a, T* b) { return *a > *b; }
};
int _X, _FLAG, _CH;
inline int read_int() {
  _X = 0;
  _FLAG = 1;
  _CH = getchar();
  while (_CH < '0' || _CH > '9') {
    if (_CH == '-') _FLAG = -1;
    _CH = getchar();
  }
  while (_CH >= '0' && _CH <= '9') {
    _X = _X * 10 + _CH - '0';
    _CH = getchar();
  }
  return _X * _FLAG;
}
inline long long read_ll() {
  long long x = 0, flag = 1;
  _CH = getchar();
  while (_CH < '0' || _CH > '9') {
    if (_CH == '-') flag = -1;
    _CH = getchar();
  }
  while (_CH >= '0' && _CH <= '9') {
    x = x * 10 + _CH - '0';
    _CH = getchar();
  }
  return x * flag;
}
template <typename T>
inline const T GCD(T a, T b) {
  T c;
  while (a != 0) {
    c = a;
    a = b % a;
    b = c;
  }
  return b;
}
inline const unsigned long long binom(unsigned long long n,
                                      unsigned long long k) {
  if (k > n) return 0;
  unsigned long long C = 1;
  for (unsigned long long i = 1; i <= k; ++i) C = (C * (n - i + 1)) / i;
  return C;
}
template <typename T, typename K>
inline const T stepen(T a, K x, T mod) {
  T res = 1;
  while (x) {
    if (x & 1) {
      res *= a;
      res %= mod;
    }
    a *= a;
    a %= mod;
    x /= 2;
  }
  return res;
}
template <typename T, typename K>
inline const T stepen(T a, K x) {
  T res = 1;
  while (x) {
    if (x & 1) res *= a;
    a *= a;
    x /= 2;
  }
  return res;
}
long long n, m, k, i, j, left, right, middle;
std::vector<int> arr[100004];
std::priority_queue<int> pq;
std::vector<int> res;
int d[100004];
int main() {
  int rr[100004];
  std::ios_base::sync_with_stdio(false);
  n = read_int();
  m = read_int();
  for (; i < m; ++i) {
    left = read_int() - 1;
    right = read_int() - 1;
    ++d[left];
    arr[right].push_back(left);
  }
  for (i = 0; i < n; ++i)
    if (d[i] == 0) pq.push(i);
  for (i = n; i; --i) {
    j = pq.top();
    pq.pop();
    rr[j] = i;
    for (auto it : arr[j])
      if (--d[it] == 0) pq.push(it);
  }
  for (i = 0; i < n; ++i) printf("%I32d ", rr[i]);
}
