#include <bits/stdc++.h>
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define FORN(i,a,b) for (i=(a);i<=(b);i++)
#define FORR(i,a,b) for (int i=(a);i>=(b);i--)
#define pb push_back

using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef set<int> si;
const int inf = 1e9;
const int mod = 1e9+7;

int g[2], k, x[2][5], n[5], i[5], _g[2];
ll fac[80], inv[80];
ll powMod(ll a, ll n, ll m){
  ll p = 1;
  while(n > 0){
    if(n & 1) p = p * a % m;
    a = a * a % m;
    n >>= 1;
  }
  return p;
}

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

  fac[0] = 1;
  inv[0] = 1;
  FOR(i, 1, 80){
    fac[i] = fac[i-1] * i % mod;
    inv[i] = powMod(fac[i], mod - 2, mod);
  }
  cin >> g[0] >> g[1] >> k;
  FOR(i, 0, k){
    cin >> x[0][i] >> x[1][i] >> n[i];
  }
  ll ans = 0;
  FORN(i[4], 0, n[4])FORN(i[3], 0, n[3])FORN(i[2], 0, n[2])FORN(i[1], 0, n[1])FORN(i[0], 0, n[0]){
    _g[0] = g[0];
    _g[1] = g[1];
    FOR(j, 0, k){
      FOR(l, 0, 2){
        _g[l] -= i[j] * x[l][j];
      }
    }
    if(_g[0] != 0 || _g[1] != 0)continue;
    ll p = fac[i[0] + i[1] + i[2] + i[3] + i[4]];
    FOR(j, 0, k){
      p = p * inv[i[j]] % mod;
    }
    ans += p;
  }
  cout << ans % mod << endl;
}