#include <bits/stdc++.h>
using namespace std;

typedef long long   signed int LL;
typedef long long unsigned int LU;

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define  inc(i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define  dec(i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

#define inII(v, l, r) ((l) <= (v) && (v) <= (r))
#define inID(v, l, r) ((l) <= (v) && (v) <  (r))

#define PB push_back
#define EB emplace_back
#define MP make_pair
#define FI first
#define SE second
#define UB upper_bound
#define LB lower_bound
#define PQ priority_queue

#define  ALL(v)  v.begin(),  v.end()
#define RALL(v) v.rbegin(), v.rend()
#define  FOR(it, v) for(auto it =  v.begin(); it !=  v.end(); ++it)
#define RFOR(it, v) for(auto it = v.rbegin(); it != v.rend(); ++it)

template<typename T> bool   setmin(T & a, T b) { if(b <  a) { a = b; return true; } else { return false; } }
template<typename T> bool   setmax(T & a, T b) { if(b >  a) { a = b; return true; } else { return false; } }
template<typename T> bool setmineq(T & a, T b) { if(b <= a) { a = b; return true; } else { return false; } }
template<typename T> bool setmaxeq(T & a, T b) { if(b >= a) { a = b; return true; } else { return false; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----

int gx, gy, k, x[5], y[5], n[5];
const int MOD = 1000000007;
LL ans;

#define F(i) for(c[i] = 0; c[i] <= n[i]; c[i]++)

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

LL divmod(LL x, LL y) {
	LL inv, m;
	ex_gcd(y, MOD, inv, m);
	if(inv < 0) { inv += MOD; }
	return x * inv % MOD;
}

int main() {
	cin >> gx >> gy >> k;
	inc(i, k) { cin >> x[i] >> y[i] >> n[i]; }
	
	int c[5];
	F(0) {
	F(1) {
	F(2) {
	F(3) {
	F(4) {
		int sx = 0, sy = 0, sn = 0;
		inc(i, 5) {
			sx += x[i] * c[i];
			sy += y[i] * c[i];
			sn += c[i];
		}
		if(sx == gx && sy == gy) {
			LL z = 1;
			inc1(i, sn) { (z *= i) %= MOD; }
			inc(i, 5) {
				inc1(j, c[i]) { z = divmod(z, j); }
			}
			(ans += z) %= MOD;
		}
	}
	}
	}
	}
	}
	
	cout << ans << endl;
	
	return 0;
}