#include <bits/stdc++.h>
using namespace std;
#define REP(i,a,n) for(int i=(a); i<(int)(n); i++)
#define rep(i,n) REP(i,0,n)
#define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it)
#define ALLOF(c) (c).begin(), (c).end()
typedef long long ll;
typedef unsigned long long ull;

#define MOD 1000000007

ll extgcd(ll a, ll b, ll &x, ll &y){
  ll d = a;
  if(b!=0){
    d = extgcd(b,a%b,y,x);
    y -= (a/b)*x;
  }else{
    x = 1; y = 0;
  }
  return d;
}

ll mod_inverse(ll a, ll m){
  ll x, y;
  extgcd(a, m, x, y);
  return (m+x%m)%m;
}

ll mod_fact(ll n, ll p){
  ll res = 1;
  while(n>0){
    ll m = n%p;
    for(ll i=1; i<=m; i++) res = (res*i)%p;
    if((n/=p)%2>0) res = p-res;
  }
  return res;
}



struct ST {
  int x, y, N;
};

ll calc(int a, int b, int c, int d, int e){
  ll sum = a + b + c + d + e;
  ll ret = mod_fact(sum, MOD);
  ret *= mod_inverse(mod_fact(a, MOD), MOD);
  ret %= MOD;
  ret *= mod_inverse(mod_fact(b, MOD), MOD);
  ret %= MOD;
  ret *= mod_inverse(mod_fact(c, MOD), MOD);
  ret %= MOD;
  ret *= mod_inverse(mod_fact(d, MOD), MOD);
  ret %= MOD;
  ret *= mod_inverse(mod_fact(e, MOD), MOD);
  ret %= MOD;
  return ret;
}


int main(){
  int Gx, Gy, K;
  cin >> Gx >> Gy >> K;

  vector<ST> v(5, (ST){0,0,0});
  rep(i,K){
    cin >> v[i].x >> v[i].y >> v[i].N;
  }

  ll ret = 0;
  rep(a,v[0].N+1){
    rep(b,v[1].N+1){
      rep(c,v[2].N+1){
        rep(d,v[3].N+1){
          rep(e,v[4].N+1){
            ll nx = 0, ny = 0;
            
            nx += a * v[0].x;
            nx += b * v[1].x;
            nx += c * v[2].x;
            nx += d * v[3].x;
            nx += e * v[4].x;
            
            ny += a * v[0].y;
            ny += b * v[1].y;
            ny += c * v[2].y;
            ny += d * v[3].y;
            ny += e * v[4].y;

            if(nx == Gx && ny == Gy){
              ret += calc(a, b, c, d, e);
              ret %= MOD;
            }
          }
        }
      }
    }
  }

  cout << ret << endl;
  
  return 0;
}