// includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>
#include <list>
#include <random>

// macros
#define ll long long int
#define pb emplace_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define rep(i, n) FOR(i, 0, n)
#define rrep(i, n) for(int i=((int)(n)-1);i>=0;i--)
#define all(x) (x).begin(),(x).end()
#define sz(x) ((int)(x).size())
#define UNIQUE(v) v.erase(unique(v.begin(), v.end()), v.end())

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
typedef pair<double, double> Pd;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;
const int mod = 1e8 + 7;

// solve
template <class T>bool chmax(T &a, const T &b){if(a < b){a = b; return 1;} return 0;}
template <class T>bool chmin(T &a, const T &b){if(a > b){a = b; return 1;} return 0;}

ll h, w;
int k;
struct point{
  int a, b;
  point(){}
  point(int a, int b): a(a), b(b){}
};

vector<point> vec, tvec;

bool comp(const point &x, const point &y){
  if(x.a != y.a)return x.a < y.a;
  return x.b < y.b;
}

template <typename T>
T power(T a, T n, T mod) {
  T res = 1;
  T tmp = n;
  T curr = a;
  while(tmp){
    if(tmp % 2 == 1){
      res = (T)((ll)res * curr % mod);
    }
    curr = (T)((ll)curr * curr % mod);
    tmp >>= 1;
  }
  return res;
}

ll fac[200001], inv[200001];

ll calc(int status){
  ll res = fac[h+w] * (inv[h] * inv[w] % mod) % mod;
  vector<point> v;
  for(int i = 0; i < k; i++){
    if((status >> i) % 2 == 1){
      v.pb(tvec[i]);
    }
  }
  sort(all(v), comp);
  vector<ll> dp(sz(v), 0);
  for(int i = 0; i < sz(v); i++){
    point p = v[i];
    dp[i] = fac[p.a+p.b] * (inv[p.a] * inv[p.b] % mod) % mod;
    for(int j = 0; j < i; j++){
      point pj = v[j];
      if(p.a >= pj.a && p.b >= pj.b){
        dp[i] = (dp[i] - dp[j] * (fac[p.a+p.b-pj.a-pj.b] * (inv[p.a-pj.a] * inv[p.b-pj.b] % mod) % mod) % mod) % mod;
      }
    }
    if(dp[i] < 0)dp[i] += mod;
    res = (res - dp[i] * (fac[h+w-p.a-p.b] * (inv[h-p.a] * inv[w-p.b] % mod) % mod) % mod) % mod;
    if(res < 0)res = res + mod;
  }
  return res;
}

int main(int argc, char const* argv[])
{
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  //cin >> h >> w >> k;
  scanf("%lld %lld %d", &h, &w, &k);
  fac[0] = 1;
  for(int i = 1; i <= 200000; i++)fac[i] = i * fac[i-1] % mod;
  inv[200000] = power<ll>(fac[200000], mod - 2, mod);
  for(int i = 199999; i >= 0; i--){
    inv[i] = (i + 1) * inv[i+1] % mod;
  }
  vec.resize(k);
  tvec.resize(k);
  rep(i, k)cin >> vec[i].a >> vec[i].b;
  tvec = vec;
  sort(all(vec), comp);
  for(int i = 0; i < (1 << k); i++){
    //cout << calc(i) << endl;
    printf("%lld\n", calc(i));
  }
	return 0;
}