#include <bits/stdc++.h>
using namespace std;
int a, b, m;
int edge[1010][1010];
int color[2][1010][1010];
int ans[1010 * 100];
void dfs(int ty, int u, int v, int c1, int c2) {
  int nv = color[ty ^ 1][v][c1];
  color[ty][u][c1] = v;
  color[ty ^ 1][v][c1] = u;
  if (nv == 0) {
    color[ty ^ 1][v][c2] = 0;
    return;
  } else {
    dfs(ty ^ 1, v, nv, c2, c1);
  }
}
int main() {
  scanf("%d%d%d", &a, &b, &m);
  int u, v;
  int ant = 0;
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &u, &v);
    edge[u][v] = i;
    int c1 = 1, c2 = 1;
    while (color[0][u][c1]) ++c1;
    while (color[1][v][c2]) ++c2;
    ant = max(ant, max(c1, c2));
    if (c1 == c2) {
      color[0][u][c1] = v;
      color[1][v][c2] = u;
    } else {
      dfs(0, u, v, c1, c2);
    }
  }
  printf("%d\n", ant);
  for (int i = 1; i <= a; i++) {
    for (int j = 1; j <= ant; j++) {
      ans[edge[i][color[0][i][j]]] = j;
    }
  }
  for (int i = 1; i <= m; i++) {
    cout << ans[i] << ' ';
  }
  return 0;
}
