#include<iostream>
#include<vector>
#include<string>
#include<cmath>
#include<algorithm>
#include<functional>
#include<numeric>
#include<queue>
#include<stack>
#include<map>
#include<unordered_map>
#include<set>
#include<bitset>


#pragma region
using namespace std;
#define FOR(i,r,n) for(ll i = (ll)(r); i < (ll)(n); i++)
#define rep(i,n) FOR(i,0LL,n)
#define RFOR(i,r,n) for(ll i=(ll)(n-1);i>=r;i--)
#define rrep(i,n) RFOR(i,0LL,n)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define COUNT(a,y,x) upper_bound(all(a), y) - lower_bound(all(a), x)
#define UNIQUE(a) sort(all(a)); a.erase(unique(all(a)), a.end())
#define pb push_back
#define endl '\n'
typedef long long int ll;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<string> vs;
typedef map<ll, ll> MAP;
const ll inf = 2222222222222222222LL;
const ll mod = 100000007LL;

ll n = 0, m = 0, ans = 0, tmp = 0, ma = -inf, mi = inf;
string s;
bool ok;
ll dx[9] = { 0,1,-1,0,0,1,1,-1,-1 }, dy[9] = { 0,0,0,1,-1,1,-1,1,-1 };
#pragma endregion
#define MAX 222222

ll a[22], b[22], f[1LL << 21];


vll fac, inv, invfac;
void comb_set(ll x = MAX) {
  fac.resize(x + 1, 0);
  invfac.resize(x + 1, 0);
  inv.resize(x + 1, 0);
  fac[0] = inv[1] = invfac[0] = 1;
  FOR(i, 1, x + 1) (fac[i] = fac[i - 1] * i) %= mod;
  FOR(i, 2, x + 1) (inv[i] = (mod - mod / i) * inv[mod%i]) %= mod;
  FOR(i, 1, x + 1) (invfac[i] = invfac[i - 1] * inv[i]) %= mod;
}
ll comb(ll x, ll y) {
  if (x < y) return 0;
  return fac[x] * invfac[x - y] % mod * invfac[y] % mod;
}

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


  comb_set(MAX);
  ll h, w, k;
  cin >> h >> w >> k;
  rep(i, k) cin >> a[i] >> b[i];
  
  rep(bit, 1LL << k) {
    vpll vp;
    pll p;
    vp.pb(make_pair(0, 0));
    vp.pb(make_pair(h, w));
    rep(i,k) if(bit>>i&1) vp.pb(make_pair(a[i], b[i]));
    sort(all(vp));
    ll x = 0, y = 0;
    tmp = 1;
    FOR(i, 1, vp.size()) {
      if (x > vp[i].second) {
        tmp = 0;
        break;
      }
      (tmp *= comb(vp[i].first + vp[i].second - y - x, vp[i].first - y)) %= mod;
      y = vp[i].first; x = vp[i].second;
    }
    f[bit] = tmp;
  }
  rep(i, k) rep(j, 1LL << k) if (j & 1LL << i) (f[j] = f[j] + mod - f[j ^ (1LL << i)]) %= mod;
  rep(bit, 1LL << k) {
    ll cnt = 0;
    rep(i, k) if (bit >> i & 1) cnt++;
    if (cnt % 2) cout << mod - f[bit] << endl;
    else cout << f[bit] << endl;
  }


  return 0;
}