// NOTE: it is recommended to use this even if you don't understand the following code.

#include <fstream>
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#define MOD 1000000007

using namespace std;

vector<int>G[200002];
int vis[200002];

void dfs(int k){
    vis[k] = 1;
    for(auto i:G[k]) if(vis[i] == 0) dfs(i);
}

int main() {
    // uncomment the two following lines if you want to read/write from files
    // ifstream cin("input.txt");
    // ofstream cout("output.txt");

    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int R, C, N;
    cin >> R >> C >> N;

    vector<int> r(N), c(N);
    for (int i = 0; i < N; ++i) {
        cin >> r[i] >> c[i];
    }

    vector<pair<int, int>>A1, A2, A3, A4;

    for(int i = 0; i < N; i++) {
            A1.push_back({r[i], i}); A2.push_back({c[i],i});A3.push_back({r[i] - c[i],i}); A4.push_back({r[i] + c[i],i});
    }

    sort(A1.begin(), A1.end());
    sort(A2.begin(), A2.end());
    sort(A3.begin(), A3.end());
    sort(A4.begin(), A4.end());

    for(int i = 0; i < N - 1; i++){
        if(A1[i].first == A1[i + 1].first) {
                G[A1[i].second].push_back(A1[i+1].second); G[A1[i+1].second].push_back(A1[i].second);
        }
        if(A2[i].first == A2[i + 1].first) {
                G[A2[i].second].push_back(A2[i+1].second); G[A2[i+1].second].push_back(A2[i].second);
        }
        if(A3[i].first == A3[i + 1].first) {
                G[A3[i].second].push_back(A3[i+1].second); G[A3[i+1].second].push_back(A3[i].second);
        }
        if(A4[i].first == A4[i + 1].first) {
                G[A4[i].second].push_back(A4[i+1].second); G[A4[i+1].second].push_back(A4[i].second);
        }
    }

    long long ans = 1;
    for(int i = 1; i <= N; i++){
        if(vis[i] == 0){
            ans = ans * 2 % MOD;
            dfs(i);
        }
    }

    cout << ans << endl; // print the result

    return 0;
}