#include "bits/stdc++.h" #include using namespace std; typedef long long ll; typedef unsigned long long ull; typedef vector veci; typedef vector vecll; typedef vector vecs; template using Hash=unordered_map; #define REP(i, a, n) for(ll i = a; i < n; i++) #define RREP(i, a, n) for(ll i = n-1; i >= a; i--) #define rep(i, n) REP(i, 0, n) #define rrep(i, n) RREP(i, 0, n) #define MD 1000000007 template T read(){T a;cin >> a;return a;} template void read(T& a){cin >> a;} template void read(T& a, Args&... args){cin >> a; read(args...);} template void rarr(T a, int n){for(int i = 0; i < n; i++) {cin >> a[i];}} template void write(T a){cout << setprecision(12) << a << endl;} template void write(T a, Args... args){cout << setprecision(12) << a << c; write(args...);} template void warr(vector a, const char* c = " "){cout << a[0];for(int i = 1; i < (int)a.size(); i++)cout << c << a[i];cout << endl;;} template void warr(T a, int n, const char* c = " "){cout << a[0];for(int i = 1; i < n; i++)cout << c << a[i];cout << endl;} void split(string s, string delim, veci& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(atoi(s.substr(pos).data()));break;}else {result.push_back(atoi(s.substr(pos, p - pos).data()));}pos = p + delim.size();}} void split(string s, string delim, vecs& result){result.clear();string::size_type pos = 0;while(pos != string::npos){string::size_type p = s.find(delim, pos);if(p == string::npos){result.push_back(s.substr(pos));break;}else {result.push_back(s.substr(pos, p - pos));}pos = p + delim.size();}} ll gcd(ll a, ll b){while(true){ll k = a % b;if(k == 0)return b;a = b;b = k;}} ll comb(ll n, ll m){ll p=1;m=min(m,n-m);for(ll i=1;i<=m;i++){p*=n-i+1;p/=i;}return p;} ull power( const ull& a, ull k, const ull& n ) { if ( a == 0 || n == 0 ) return( 0 ); if ( k == 0 ) return( 1 % n ); ull currentMod = a % n; ull currentValue = ( ( k & 1 ) > 0 ) ? currentMod : 1; for ( k >>= 1 ; k > 0 ; k >>= 1 ) { currentMod = ( currentMod * currentMod ) % n; if ( ( k & 1 ) > 0 ) currentValue = ( currentValue * currentMod ) % n; } return( currentValue ); } bool add_array(int *kt,int *ni,int size){ rep(i,size+1){ kt[i]++; if(kt[i]<=ni[i])break; kt[i]=0; } return (bool)kt[size]; } int main(void) { int gx,gy,k; int x[10]={0},y[10]={0},ni[10]={0}; ll frac[100]={1,1}; REP(i,2,100)frac[i]=(i*frac[i-1])%MD; read(gx,gy,k); ni[k]=1; rep(i,k)read(x[i],y[i],ni[i]); int kt[10]={0}; ll res=0; while(true){ int xx=0,yy=0,kt_s=0;; rep(i,k){ xx+=x[i]*kt[i]; yy+=y[i]*kt[i]; kt_s+=kt[i]; } if(xx==gx&&yy==gy){ ll p=frac[kt_s]; rep(i,k){ if(kt[i]==0)continue; p=(p*power(frac[kt[i]],MD-2,MD))%MD; } res=(res+p)%MD; } if(add_array(kt,ni,k))break; } write(res); return 0; }