#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;
int ln, rn, m, i, j, ans, col, v, x, y, n;
int mcol[2005][2005], acol[2005], mk[2005], mrk[2005];
vector <pair <int, int> > g[N];
void dfs(int v, int pr)
{
mk[v] = 1;
mrk[v] = 1;
for (auto u : g[v])
{
if (u.F == pr || mk[u.F]) continue;
col = 1;
while (col <= ans && (mcol[v][col] || mcol[u.F][col])) col++;
mcol[v][col] = 1;
mcol[u.F][col] = 1;
acol[u.S] = col;
dfs(u.F, v);
}
mk[v] = 0;
}
int main()
{
srand(time(0));
ios_base::sync_with_stdio(0);
iostream::sync_with_stdio(0);
ios::sync_with_stdio(0);
cin.tie(NULL);
cout.tie(NULL);
// in("sum.in");
// out("output.txt");
cin >> ln >> rn >> m;
for (i = 1; i <= m; i++)
{
cin >> x >> y;
y += ln;
g[x].pb({y, i});
g[y].pb({x, i});
}
n = ln + rn;
ans = 0;
for (i = 1; i <= n; i++) ans = max(ans, int(g[i].size()));
for (i = 1; i <= n; i++)
if (!mrk[i]) dfs(i, -1);
cout << ans << el;
for (i = 1; i <= m; i++) cout << acol[i] << el;
}
// 119 78 175 411
