MOD = int( 1e9 ) + 7

fact = [ 1 ]
inv_fact = [ 1 ]
for i in range( 1, 100, 1 ):
  fact.append( fact[ i - 1 ] * i % MOD )
  inv_fact.append( pow( fact[ i ], MOD - 2, MOD ) )

Gx, Gy, K = map( int, input().split() )
X = []
Y = []
N = []
for i in range( K ):
  x, y, n = map( int, input().split() )
  X.append( x )
  Y.append( y )
  N.append( n )

ans = 0
def dfs( t, x, y, vis = None ):
  if vis == None:
    vis = []
  if t == K:
    if x == Gx and y == Gy:
      f = fact[ sum( vis ) ]
      for i in range( len( vis ) ):
        f = f * inv_fact[ vis[ i ] ] % MOD
      global ans
      ans = ( ans + f ) % MOD
    return
  for i in range( N[ t ] + 1 ):
    vis.append( i )
    dfs( t + 1, x + X[ t ] * i, y + Y[ t ] * i, vis )
    vis.pop()

dfs( 0, 0, 0 )
print( ans )