#include <fstream>
#include <cstring>
#include <vector>
#include <set>
using namespace std;
#define MODULO 2000003
#define IN "padure2.in"
#define OUT "padure2.out"
#define ciuperca -1 
#define NMAX 1000005

int n, m, nr_ciuperci;
int P[2][NMAX];
set <pair<int,int>> ciup;

int main()
{
	ifstream fin(IN);
	ofstream fout(OUT);

	fin >> n >> m >> nr_ciuperci;
	
	int k;
	int x, y;
	for (k = 1; k <= nr_ciuperci; k++)
	{
		fin >> x >> y;
		ciup.insert(make_pair(x, y));
	}

	int i, j; int a = 0;
	P[1][1] = 1;


	for (i = 1; i <= n; i++)
	{
		set<pair<int, int> > :: iterator it =  ciup.upper_bound(make_pair(i, 0));
		while (it!=ciup.end() && it->first == i)
		{
			P[1 - a][it->second] = ciuperca;
			it++;
		}


		/*for (j = 0; j < ciup[i].size(); j++)
			P[1 - a][ciup[i][j]] = ciuperca;*/

		for (j = 1; j <= m; j++)
		{
			if (P[1 - a][j] == ciuperca)
				continue;
		
			if (P[a][j] != ciuperca)
				P[1-a][j] = (P[1-a][j] + P[a][j]) % MODULO;
			if (P[1-a][j - 1] != ciuperca)
				P[1-a][j] = (P[1-a][j] + P[1-a][j - 1]) %MODULO;
		}

		memset(P[a], 0, sizeof(P[a]));
		
		a = 1 - a;
	}

	fout << P[a][m] % MODULO << '\n';

	fin.close();
	fout.close();
	return 0;
}