#include <queue>
#include <string.h>
#include <stdio.h>
#include <vector>

const int MAX_N = 8192;

std::vector<int> G[MAX_N];
int l[MAX_N], r[MAX_N];
bool openL[MAX_N], openR[MAX_N];
bool visited[MAX_N];

bool cupleaza(int u) {
  if (visited[u])
    return false;
  visited[u] = true;
  for (int v : G[u])
    if (r[v] == 0) {
      r[v] = u;
      l[u] = v;
      return true;
    }
  for (int v : G[u])
    if (cupleaza(r[v])) {
      r[v] = u;
      l[u] = v;
      return true;
    }
  return false;
}

void dfs(int u) {
  for (int v : G[u])
    if (!openR[v]) {
      openR[v] = true;
      dfs(v);
    }
}

int main() {

  freopen("felinare.in", "r", stdin);
  freopen("felinare.out", "w", stdout);

  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    G[u].push_back(v);
  }
  bool ok;
  do {
    ok = false;
    memset(visited, false, sizeof(visited));
    for (int i = 1; i <= n; i++)
      if (l[i] == 0)
       ok |= cupleaza(i);
  } while (ok);
  int ans = 0;
  for (int i = 1; i <= n; i++)
    if (l[i] > 0)
      ans++;
  printf("%d\n", 2 * n - ans);
  memset(visited, false, sizeof(visited));
  for (int i = 1; i <= n; i++)
    if (l[i] == 0)
      dfs(i);
  for (int i = 1; i <= n; i++)
    if (l[i] != 0 && !openR[l[i]])
      openL[i] = true;
  for (int i = 1; i <= n; i++) {
    if (openL[i] && openR[i])
      printf("0\n");
    else if (!openL[i] && openR[i])
      printf("1\n");
    else if (openL[i] && !openR[i])
      printf("2\n");
    else
      printf("3\n");
  }

  return 0;
}