#include <bits/stdc++.h>
using namespace std;
int color[2][1111][1111];
int id[1111][1111];
int ans[112345];
void dfs(int p, int u, int v, int c1, int c2) {
  int tmp = color[p ^ 1][v][c1];
  color[p][u][c1] = v;
  color[p ^ 1][v][c1] = u;
  if (!tmp) {
    color[p ^ 1][v][c2] = 0;
    return;
  }
  dfs(p ^ 1, v, tmp, c2, c1);
}
int main() {
  int n, m, k;
  scanf("%d%d%d", &n, &m, &k);
  int cnt = 0;
  for (int i = 1; i <= k; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    id[u][v] = i;
    int c1 = 1;
    int c2 = 1;
    while (color[0][u][c1]) c1++;
    while (color[1][v][c2]) c2++;
    cnt = max(cnt, max(c1, c2));
    if (c1 == c2) {
      color[0][u][c1] = v;
      color[1][v][c1] = u;
    } else {
      dfs(0, u, v, c1, c2);
    }
  }
  printf("%d\n", cnt);
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= cnt; j++) {
      if (color[0][i][j] != 0) {
        ans[id[i][color[0][i][j]]] = j;
      }
    }
  for (int i = 1; i <= k; i++) printf("%d ", ans[i]);
  printf("\n");
  return 0;
}
