#include <bits/stdc++.h>
using namespace std;

const long long MOD = 1e9 + 7;

int r, c, n;
vector<vector<int>> nodes;

bool sort1(vector<int> a, vector<int> b) {
    return (a[0] <= b[0]);
}

bool sort2(vector<int> a, vector<int> b) {
    return (a[1] <= b[1]);
}

bool sort3(vector<int> a, vector<int> b) {
    return (a[1] - a[0] <= b[1] - b[0]);
}

bool sort4(vector<int> a, vector<int> b) {
    return (a[0] + a[1] <= b[0] + b[1]);
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    cin >> r >> c >> n;

    vector<bool> group(n, false);

    for (int i=0; i < n; i++) {
        int u, v;
        cin >> u >> v;
        nodes.push_back({u, v, i});
    }

    int ans = 0;

    sort(nodes.begin(), nodes.end(), sort1);
    for (int i=1; i < n; i++) {
        vector<int> prev = nodes[i - 1];
        vector<int> cur = nodes[i];
        if (prev[0] == cur[0]) {
            if (!group[prev[2]] && !group[cur[2]]) {
                ans++;
            }
            group[prev[2]] = true;
            group[cur[2]] = true;
        }
    }
    sort(nodes.begin(), nodes.end(), sort2);
    for (int i=1; i < n; i++) {
        vector<int> prev = nodes[i - 1];
        vector<int> cur = nodes[i];
        if (prev[1] == cur[1]) {
            if (!group[prev[2]] && !group[cur[2]]) {
                ans++;
            }
            group[prev[2]] = true;
            group[cur[2]] = true;
        }
    }
    sort(nodes.begin(), nodes.end(), sort3);
    for (int i=1; i < n; i++) {
        vector<int> prev = nodes[i - 1];
        vector<int> cur = nodes[i];
        if (prev[1] - prev[0] == cur[1] - cur[0]) {
            if (!group[prev[2]] && !group[cur[2]]) {
                ans++;
            }
            group[prev[2]] = true;
            group[cur[2]] = true;
        }
    }
    sort(nodes.begin(), nodes.end(), sort4);
    for (int i=1; i < n; i++) {
        vector<int> prev = nodes[i - 1];
        vector<int> cur = nodes[i];
        if (prev[1] + prev[0] == cur[1] - cur[0]) {
            if (!group[prev[2]] && !group[cur[2]]) {
                ans++;
            }
            group[prev[2]] = true;
            group[cur[2]] = true;
        }
    }

    for (int i=0; i < n; i++) {
        if (!group[i]) {
            ans++;
        }
        group[i] = true;
    }

    int res = 1;

    while (ans--) {
        res = (res * 2) % MOD;
    }

    cout << res << '\n';

    return 0;
}