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 INF = numeric_limits<int>::max() - 1;
const double EPS = 1e-10;
const double gam = 0.5772156649015328606;
const double PI = acos(-1.0);
long long dx[] = {0, 1, 0, -1};
long long dy[] = {1, 0, -1, 0};
long long dxx[] = {1, 0, -1, 0, 1, -1, -1, 1};
long long dyy[] = {0, 1, 0, -1, 1, 1, -1, -1};
const int MOD = 1000000007;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
inline int sign(const double &x) { return (x > +EPS) - (x < -EPS); }
inline int doublecmp(const double &a, const double &b) { return sign(a - b); }
inline ostream &pdb(int prcs, double x) {
  return cout << setprecision(prcs) << fixed << (sign(x) ? (x) : 0) << "\n";
}
template <typename type>
inline type gcd(type a, type b) {
  if (b)
    while ((a %= b) && (b %= a))
      ;
  return a + b;
}
template <typename type>
inline type lcm(type a, type b) {
  return a / gcd(a, b) * b;
}
inline long long binexpo(long long x, long long y, long long mod = MOD) {
  long long res = 1;
  while (y) {
    if (y & 1) res = ((res % mod) * (x % mod)) % mod;
    x = ((x % mod) * (x % mod)) % mod, y >>= 1;
  }
  return res;
}
template <typename istream, typename type>
inline istream &operator>>(istream &cin, vector<type> &x) {
  for (int i = 0; i < x.size(); i++) cin >> x[i];
  return cin;
}
template <typename ostream, typename type>
inline ostream &operator<<(ostream &cout, const vector<type> &x) {
  for (int i = 0; i < x.size(); i++) cout << x[i] << " \n"[i + 1 == x.size()];
  return cout;
}
void __print(int x) { cerr << x; }
void __print(long x) { cerr << x; }
void __print(long long x) { cerr << x; }
void __print(unsigned x) { cerr << x; }
void __print(unsigned long x) { cerr << x; }
void __print(unsigned long long x) { cerr << x; }
void __print(float x) { cerr << x; }
void __print(double x) { cerr << x; }
void __print(long double x) { cerr << x; }
void __print(char x) { cerr << '\'' << x << '\''; }
void __print(const char *x) { cerr << '\"' << x << '\"'; }
void __print(const string &x) { cerr << '\"' << x << '\"'; }
void __print(bool x) { cerr << (x ? "true" : "false"); }
template <typename T, typename V>
void __print(const pair<T, V> &x) {
  cerr << '{';
  __print(x.first);
  cerr << ',';
  __print(x.second);
  cerr << '}';
}
template <typename T>
void __print(const T &x) {
  int f = 0;
  cerr << '{';
  for (auto &i : x) cerr << (f++ ? "," : ""), __print(i);
  cerr << "}";
}
void _print() { cerr << "]\n"; }
template <typename T, typename... V>
void _print(T t, V... v) {
  __print(t);
  if (sizeof...(v)) cerr << ", ";
  _print(v...);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cout.tie(NULL);
  int n, m;
  cin >> n >> m;
  vector<int> v[n + 1], deg(n + 1), ans(n + 1);
  int x, y;
  while (m--) cin >> x >> y, v[y].push_back(x), deg[x]++;
  priority_queue<int> pq;
  for (int i = 1; i <= n; i++)
    if (!deg[i]) pq.push(i);
  int cnt(n);
  while (!pq.empty()) {
    int node = pq.top();
    pq.pop();
    ans[node] = cnt--;
    for (int child : v[node]) {
      deg[child]--;
      if (!deg[child]) pq.push(child);
    }
  }
  for (int i = 1; i <= n; i++) cout << ans[i] << " ";
  return 0;
}
