def solve():
	p = 10**9+7
	Comb = [[0]*76 for i in xrange(76)]
	Comb[0][0] = 1
	Gx,Gy,K = map(int,raw_input().split())
	assert -10**5 <= Gx <= 10**5
	assert -10**5 <= Gy <= 10**5
	assert 1 <= K <= 5
	G = (Gx,Gy)
	for i in xrange(K*15):
		for j in xrange(i+2):
			Comb[i+1][j] = (Comb[i][j] + (Comb[i][j-1] if j > 0 else 0)) % p
	dp = [None]*(1<<(4*K))
	dp[0] = (0,0)
	ans = 0
	check_set = set()
	for i in xrange(K):
		x,y,N = map(int,raw_input().split())
		assert -10**4 <= x <= 10**4
		assert -10**4 <= y <= 10**4
		assert 1 <= N <= 15
		assert (x,y) not in check_set
		check_set.add((x,y))
		shift = 4*i
		for j in xrange(1,N+1):
			mx = j*x; my = j*y
			bit = j<<shift
			for k in xrange(1<<shift):
				if dp[k] is None:
					continue
				dp[k+bit] = (dp[k][0]+mx,dp[k][1]+my)
	for k in xrange(1<<(4*K)):
		if dp[k] != G:
			continue
		total = sum((k>>(i*4))%16 for i in xrange(K))
		tmp = 1
		for i in xrange(K):
			dup_n = (k>>(i*4))%16
			tmp = tmp * Comb[total][dup_n] % p
			total -= dup_n
		ans = (ans + tmp) % p
	print ans
solve()