#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
long mod=1e8+7;
long power(long a,long b){return b?power(a*a%mod,b/2)*(b%2?a:1)%mod:1;}
long F[2<<17],I[2<<17];
long C(int N,int K){return F[N]*I[N-K]%mod*I[K]%mod;}
int H,W,K;
int a[20],b[20];
long A[1<<20];
main()
{
	F[0]=1;
	for(int i=1;i<2<<17;i++)F[i]=F[i-1]*i%mod;
	I[(2<<17)-1]=power(F[(2<<17)-1],mod-2);
	for(int i=(2<<17)-1;i--;)I[i]=I[i+1]*(i+1)%mod;
	cin>>H>>W>>K;
	for(int i=0;i<K;i++)cin>>a[i]>>b[i];
	for(int i=0;i<1<<K;i++)
	{
		int nx=0,ny=0;
		long ans=1;
		vector<pair<int,int> >AB;
		for(int j=0;j<K;j++)if(i>>j&1)AB.push_back(make_pair(a[j],b[j]));
		sort(AB.begin(),AB.end());
		for(pair<int,int>ab:AB)
		{
			if(nx<=ab.first&&ny<=ab.second)
			{
				int dx=ab.first-nx,dy=ab.second-ny;
				ans=ans*C(dx+dy,dx)%mod;
				nx=ab.first;
				ny=ab.second;
			}
			else ans=0;
		}
		int dx=H-nx,dy=W-ny;
		ans=ans*C(dx+dy,dx)%mod;
		A[i]=AB.size()%2?mod-ans:ans;
	}
	for(int i=0;i<K;i++)for(int j=0;j<1<<K;j++)if(j>>i&1)(A[j]+=A[j^1<<i])%=mod;
	for(int i=0;i<1<<K;i++)cout<<A[i]<<"\n";
}