#include <bits/stdc++.h>

using namespace std;

const int N = 7002;
const int INF = 1e8 + 5;

bitset <N << 1> adj[N << 1];
int m, match[N << 1], dist[N << 1];

bool bfs() {
  queue <int> q; 
  for (int i = 1; i <= m; ++i) {
    if (!match[i]) dist[i] = 0, q.emplace(i);
    else dist[i] = INF;
  } 
  dist[0] = INF;
  while (!q.empty()) {
    int u = q.front(); q.pop();
    if (!u) continue; 
    for (int v = 1; v <= m; ++v) if (adj[u][v]) {
      if (dist[match[v]] == INF) {
        dist[match[v]] = dist[u] + 1, 
        q.emplace(match[v]);
      }
    }
  } 
  return dist[0] != INF;    
}

bool dfs (int u) {
  if (!u) return 1; 
  for (int v = 1; v <= m; ++v) if (adj[u][v]) {
    if (dist[match[v]] == dist[u] + 1 and dfs(match[v])) {
      match[u] = v, match[v] = u;
      return 1; 
    } 
  } 
  dist[u] = INF;
  return 0;
}

int hopcroftKarp() {
  int ret = 0; 
  while (bfs()) {
    for (int i = 1; i <= m; ++i) {
      ret += !match[i] and dfs(i);
    }
  }
  return ret;
}

bool vis[N];
int n, comp[N], root, in[N], ans[N];
vector <int> stk, g[N], h[N], dag[N];

void forw (int u) {
  vis[u] = 1;
  for (int v : g[u]) if (!vis[v]) forw(v);
  stk.emplace_back(u);
}

void bacw (int u) {
  comp[u] = m;
  for (int v : h[u]) if (!comp[v]) bacw(v);
}

void mark (int u) {
  adj[root][m + u] = adj[m + u][root] = 1;
  for (int v : dag[u]) if (!adj[root][m + v]) mark(v);
}

int main() {
  cin >> n >> m;
  while (m--) {
    int u, v;
    scanf("%d %d", &u, &v);
    g[u].emplace_back(v);
    h[v].emplace_back(u);
  }
  for (int i = 1; i <= n; ++i) if (!vis[i]) forw(i);
  reverse(stk.begin(), stk.end()), m = 0;
  for (int i : stk) if (!comp[i]) ++m, bacw(i);
  for (int i = 1; i <= n; ++i) for (int j : g[i]) {
    if (comp[i] ^ comp[j]) dag[comp[i]].emplace_back(comp[j]);
  }
  for (int i = 1; i <= m; ++i) {
    root = i, mark(i), adj[i][m + i] = adj[m + i][i] = 0;
  }
  m <<= 1; hopcroftKarp(); m >>= 1;
  for (int i = 1; i <= m; ++i) if (match[i]) match[i] -= m, ++in[match[i]];
  int color = 0;
  for (int i = 1; i <= m; ++i) if (!in[i]) {
    int at = i; ++color;
    while (at) ans[at] = color, at = match[at];
  }
  for (int i = 1; i <= n; ++i) printf("%d ", ans[comp[i]]);
  cout << '\n';
  return 0;
}