#include <cstdio>

#include <cstring>

using namespace std;

const int MAX_XNODE = 1010, MAX_YNODE = 1010, MAX_EDGE = MAX_XNODE*MAX_YNODE;

#define LOOP(i, n) for(int i=1; i<=n; i++)

struct Hungary

{

private:

	struct Xnode;

	struct Ynode;

	struct Edge;

	struct Xnode

	{

		Edge *Head;

	}_xNodes[MAX_XNODE];

	int _xCnt;

	struct Ynode

	{

		Xnode *Match;

		bool Vis;

	}_yNodes[MAX_YNODE];

	int _yCnt;

	struct Edge

	{

		Xnode *X;

		Ynode *Y;

		Edge *Next;

	}*_edges[MAX_EDGE];

	int _eCnt;

	Edge *NewEdge()

	{

		return _edges[++_eCnt] = new Edge();

	}

	bool Dfs(Xnode *x)

	{

		for (Edge *e = x->Head; e; e = e->Next)

		{

			if (!e->Y->Vis)

			{

				e->Y->Vis = true;

				if (!e->Y->Match || Dfs(e->Y->Match))

				{

					e->Y->Match = x;

					return true;

				}

			}

		}

		return false;

	}

public:

	Hungary(){}

	Hungary(int xCnt, int yCnt) :_xCnt(xCnt), _yCnt(yCnt), _eCnt(0)

	{

		memset(_xNodes, 0, sizeof(_xNodes));

		memset(_yNodes, 0, sizeof(_yNodes));

		memset(_edges, 0, sizeof(_edges));

	}

	void AddEdge(int xId, int yId)

	{

		Xnode *x = _xNodes + xId;

		Ynode *y = _yNodes + yId;

		Edge *e = NewEdge();

		e->X = x;

		e->Y = y;

		e->Next = x->Head;

		x->Head = e;

	}

	int GetMatchCnt()

	{

		int ans = 0;

		LOOP(xId, _xCnt)

		{

			LOOP(yId, _yCnt)

				_yNodes[yId].Vis = false;

			ans += Dfs(_xNodes + xId);

		}

		return ans;

	}

};

int main()

{

#ifdef _DEBUG

	freopen("c:\\noi\\source\\input.txt", "r", stdin);

#endif

	int totX, totY, totE, xId, yId;

	scanf("%d%d%d", &totX, &totY, &totE);

	static Hungary g(totX, totY);

	while (totE--)

	{

		scanf("%d%d", &xId, &yId);

		if (xId > totX || yId > totY)

			continue;

		g.AddEdge(xId, yId);

	}

	printf("%d\n", g.GetMatchCnt());

	return 0;

}