def recur(x,y,use,idx):
	if idx == K:
		if x != Gx or y != Gy:
			return 0
		total = sum(use)
		cnt = 1
		for n in xrange(K):
			cnt = cnt * Comb[total][use[n]] % p
			total -= use[n]
		return cnt
	tmp = 0
	for i in xrange(cN[idx]+1):
		use[idx] = i
		tmp = (tmp + recur(x+cx[idx]*i,y+cy[idx]*i,use,idx+1)) % p
	return tmp
p = 10**9+7
Gx,Gy,K = map(int,raw_input().split())
cx = [0]*K; cy = [0]*K; cN = [0]*K; use = [0]*K
Comb = [[0]*(K*15+1) for i in xrange(K*15+1)]
Comb[0][0] = 1
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
for i in xrange(K):
	cx[i],cy[i],cN[i] = map(int,raw_input().split())
print recur(0,0,use,0)