#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[N], y[N], n;
set <int> se[N];
vector <int> g[N];
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[i] >> y[i];
y[i] += ln;
g[x[i]].pb(y[i]);
g[y[i]].pb(x[i]);
}
n = ln + rn;
ans = 0;
for (i = 1; i <= n; i++) ans = max(ans, int(g[i].size()));
int mx = 1;
while (mx < ans) mx *= 2;
cout << mx << el;
for (i = 1; i <= n; i++)
for (j = 1; j <= mx; j++)
se[i].insert(j);
for (i = 1; i <= m; i++)
{
for (auto col : se[x[i]])
{
if (se[y[i]].find(col) != se[y[i]].end())
{
se[y[i]].erase(col);
se[x[i]].erase(col);
cout << col << el;
break;
}
}
}
}
// 119 78 175 411
