#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=1e8+7;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k>0){
        if(k%2==1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k/=2;
    }
    return ans;
}
ll inv(ll a){
	return powmod(a, MOD-2);
}
int main()
{
	ll f[200001]; f[0]=1;
	for(ll i=1; i<=200000; i++) f[i]=f[i-1]*i%MOD;
	ll invf[200001];
	invf[200000]=inv(f[200000]);
	for(ll i=200000-1; i>=0; i--) invf[i]=invf[i+1]*(i+1)%MOD;
	int h, w, k;
	cin>>h>>w>>k;
	int a[20], b[20];
	for(int i=0; i<k; i++) cin>>a[i]>>b[i];
	ll c[1<<20];
	c[0]=f[h+w]*invf[h]%MOD*invf[w]%MOD;
	for(int i=1; i<(1<<k); i++){
		vector<P> v;
		for(int j=0; j<k; j++){
			if(i&(1<<j)) v.push_back({a[j], b[j]});
		}
		sort(v.begin(), v.end());
		v.push_back({h, w});
		P pr=P(0, 0);
		c[i]=1;
		for(auto p:v){
			if(p.first>=pr.first && p.second>=pr.second){
				c[i]*=(f[p.first-pr.first+p.second-pr.second]*invf[p.first-pr.first]%MOD*invf[p.second-pr.second]%MOD);
				c[i]%=MOD;
				pr=p;
			}else{
				c[i]=0;
				break;
			}
		}
	}
	for(int i=0; i<k; i++){
		for(int j=0; j<(1<<k); j++){
			if(j&(1<<i)){
			    c[j]-=c[j^(1<<i)];
			    c[j]=(c[j]+MOD)%MOD;
			}
		}
	}
	for(int i=0; i<(1<<k); i++){
	    int ct=0;
	    for(int j=0; j<k; j++) if(i&(1<<j)) ct++;
	    if(ct&1) printf("%lld\n", (MOD-c[i])%MOD);
	    else printf("%lld\n", c[i]);
	}
	return 0;
}