#include <iostream>
#include <vector>

using namespace std;

vector<int> G[10002];
int n , m , e , r[10002] , l[10002] , CUPLAJ;
bool u[10002];

int cuplaj(const int nod)
{
	if(u[nod]) return 0;
	u[nod] = 1;
	for(vector<int>::iterator it=G[nod].begin();it!=G[nod].end();++it)
		if(!r[*it])
		{
			l[nod] = *it;
			r[*it] = nod;
			return 1;
		}
	for(vector<int>::iterator it=G[nod].begin();it!=G[nod].end();++it)
		if(cuplaj(r[*it]))
		{
			l[nod] = *it;
			r[*it] = nod;
			return 1;
		}
	return 0;
}

int main()
{
	freopen("cuplaj.in","r",stdin);
	freopen("cuplaj.out","w",stdout);
	scanf("%d %d %d",&n,&m,&e);
	for(int x,y;e;e--)
	{
		scanf("%d %d",&x,&y);
		G[x].push_back(y);
	}
	for(int change = 1;change;)
	{
		change = 0;
		memset(u,0,sizeof(u));
		for(int i=1;i<=n;++i)
			if(!l[i])
				change|=cuplaj(i);
	}

	for(int i=1;i<=n;++i) CUPLAJ +=(l[i]>0);
	printf("%d\n",CUPLAJ);
	for(int i=1;i<=n;++i)
		if(l[i]>0) 
			printf("%d %d\n",i,l[i]);
	return 0;
}