//Code by Patcas Csaba
//Time complexity:
//Space complexity:
//Method: Test citire
//Working time: 23:55 - 

#include <stdio.h>
#include <ctype.h>
#include <vector>
#include <string> 
#include <set> 
#include <map> 
#include <iostream> 
#include <sstream> 
#include <numeric> 
#include <algorithm> 
#include <cmath> 
#include <queue> 
#include <bitset> 

using namespace std;

#define in_file "cuplaj.in"
#define out_file "cuplaj.out"

#define VI vector <int>
#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define S size()
#define B begin() 
#define E end() 
#define X first
#define Y second
#define PB push_back
#define MP make_pair
#define ALL(x) x.begin(),x.end()
#define repeat do{ 
#define until(x) }while(!(x)); 

#define maxBuf 65536

int n1, n2, m, n, ind;
vector <VI> g;
char buf[maxBuf];
FILE* fin=fopen(in_file,"r");

void solve()
{
}

int ReadNr()
{
	int ans=0;
	while (ind<maxBuf && isdigit(buf[ind]))
	{
		ans=ans*10+buf[ind]-'0';
		++ind;
	}
	if (ind==maxBuf)
	{
		fread(buf,1,maxBuf,fin);
		ind=0;
		while (ind<maxBuf && isdigit(buf[ind]))
		{
			ans=ans*10+buf[ind]-'0';
			++ind;
		}
	}
	++ind;
	return ans;
}

int main()
{
	fscanf(fin,"%d%d%d\n",&n1,&n2,&m);
	n=n1+n2;
	g.resize(n+1);
	fread(buf,1,maxBuf,fin);
	ind=0;
	FORN(i,m)
	{
		int x,y;
		x=ReadNr();
		y=ReadNr();
		g[x].PB(n1+y);
		g[n1+y].PB(x);
	}
	fclose(fin);

	solve();

	FILE* fout=fopen(out_file,"w");
	fclose(fout);
	
	return 0;
}