#include <iostream>
#include <fstream>
#include <vector>
#include <utility>
#include <iomanip>
#include <map>
#include <set>

using namespace std;
const int MOD = 2000003;

inline std::pair<int, int>& static_pair(int x, int y) {
    static std::pair<int, int> result;
    result.first = x;
    result.second = y;
    return result;
}

int main()
{
    ifstream in("padure2.in");
    ofstream out("padure2.out");

    std::map< int, std::set<int>* > mushrooms;
    int N, M, C;
    in >> N >> M >> C;
    for (int i = 0; i < C; ++i) {
        int x, y;
        in >> x >> y;
        if (mushrooms.count(x) == 0) {
            mushrooms[x] = new set<int>();
        }
        mushrooms[x]->insert(y);
    }

    std::vector<int> currentLine(M + 1000);
    const std::set<int> emptySet;
    int firstMushroom = -1;
    if (mushrooms.count(1) > 0) {
        firstMushroom = *(mushrooms[1]->begin());
    }
    for (int i = 1; i <= M; ++i) {
        if (i == firstMushroom) {
            break;
        }
        currentLine[i] = 1;
    }

    for (int ln = 2; ln <= N; ++ln) {
        auto& currentLineMushrooms = (mushrooms.count(ln) > 0) ? *(mushrooms[ln]) : emptySet;
//        if (mushrooms.count(ln) > 0) {
//            cout << ln << " has mushrooms" << endl;
//        }
//        else {
//            cout << ln << " has no mushrooms, emptySet size = " << emptySet.size() << endl;
//        }

        auto it = currentLineMushrooms.begin();
        auto end = currentLineMushrooms.end();
        for (int i = 1; i <= M; ++i) {
//            if (it != end) {
//                cout << "\tat " << i << " next mushroom is " << *it << endl;
//            }
//            else {
//                cout << "\tat " << i << " there are no more mushrooms coming" << endl;
//            }

            if ((it == end) || (it != end && *it != i)) {
                currentLine[i] += currentLine[i - 1];
                if (currentLine[i] >= MOD) {
                    currentLine[i] -= MOD;
                }
            }
            else {
                currentLine[i] = 0;
                if (it != end && *it == i) {
                    it++;
                }
            }
        }
    }

    out << currentLine[M] << endl;
    return 0;
}