#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > edge[2001];
pair<int, int> e[100001];
int cnt[1001];
map<pair<int, int>, int> mp;
void dfs(int x, int c, int cs) {
  for (auto& it : edge[x])
    if (it.second == c) {
      dfs(it.first, cs - c, cs);
      for (auto& it2 : edge[it.first])
        if (it2.first == x) {
          it2.second = cs - c;
          break;
        }
      it.second = cs - c;
      break;
    }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int a, b, m;
  cin >> a >> b >> m;
  int ans = 0;
  for (int i = 1; i <= m; i++) {
    cin >> e[i].first >> e[i].second;
    e[i].second += a;
    edge[e[i].first].emplace_back(make_pair(e[i].second, 0));
    edge[e[i].second].emplace_back(make_pair(e[i].first, 0));
  }
  for (int i = 1; i <= a + b; i++) ans = max(ans, (int)edge[i].size());
  for (int i = 1; i <= m; i++) {
    int u = e[i].first, v = e[i].second, c1, c2, it1, it2;
    for (int j = 1; j <= ans; j++) cnt[j] = 0;
    for (int j = 0; j < edge[u].size(); j++) {
      cnt[edge[u][j].second] += 1;
      if (edge[u][j].first == v) it1 = j;
    }
    for (int j = 0; j < edge[v].size(); j++) {
      cnt[edge[v][j].second] += 2;
      if (edge[v][j].first == u) it2 = j;
    }
    bool ok = false;
    for (int j = 1; j <= ans; j++)
      if (!cnt[j]) {
        edge[u][it1].second = edge[v][it2].second = j;
        ok = true;
        break;
      }
    if (ok) continue;
    for (int j = 1; j <= ans; j++)
      if (cnt[j] == 1) {
        c1 = j;
        break;
      }
    for (int j = 1; j <= ans; j++)
      if (cnt[j] == 2) {
        c2 = j;
        break;
      }
    dfs(u, c1, c1 + c2);
    edge[u][it1].second = edge[v][it2].second = c1;
  }
  for (int i = 1; i <= a; i++)
    for (auto it : edge[i]) {
      mp[make_pair(i, it.first)] = it.second;
    }
  cout << ans << '\n';
  for (int i = 1; i <= m; i++) cout << mp[e[i]] << ' ';
  cout << endl;
}
