from math import log
def solve():
	p = 10**9+7; F = [1]; FI = [0]*16
	for i in xrange(75): F.append((i+1)*F[i]%p)
	FI[15] = pow(F[15],p-2,p)
	for i in xrange(15,0,-1): FI[i-1] = i*FI[i]%p

	Gx,Gy,K = map(int,raw_input().split())
	G = (Gx,Gy); dp = [None]*(1<<K*4); dp[0] = (0,0)
	for i in xrange(K):
		x,y,N = map(int,raw_input().split())
		mul = 1; shift = i*4
		for j in xrange(int(log(N,2))):
			mx,my = x*mul,y*mul
			for k in xrange((1<<j+shift)-1,-1,-1):
				if dp[k] is None: continue
				dp[k+(mul<<shift)]=(dp[k][0]+mx,dp[k][1]+my)
			N -= mul; mul *= 2
		if N > 0:
			mx,my = x*N,y*N
			for k in xrange((1<<4+shift)-1,-1,-1):
				if dp[k] is None: continue
				dp[k+(N<<shift)]=(dp[k][0]+mx,dp[k][1]+my)
	ans = 0
	for k in xrange(1<<K*4):
		if dp[k] != G:continue
		total = 0; deno = 1
		for j in xrange(K):
			dup_n = k%16; k>>=4
			total += dup_n; deno=deno*FI[dup_n]%p
		ans = (ans + F[total]*deno)%p
	print ans
solve()