import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum MO = 10L^^9 + 7;
enum LIM = 100;

int GX, GY, K;
int[] X, Y, N;

void main() {
  auto binom = new long[][](LIM, LIM);
  foreach (n; 0 .. LIM) {
    binom[n][0] = binom[n][n] = 1;
    foreach (k; 1 .. n) {
      binom[n][k] = (binom[n - 1][k - 1] + binom[n - 1][k]) % MO;
    }
  }
  
  try {
    for (; ; ) {
      GX = readInt();
      GY = readInt();
      K = readInt();
      X = new int[K];
      Y = new int[K];
      N = new int[K];
      foreach (i; 0 .. K) {
        X[i] = readInt();
        Y[i] = readInt();
        N[i] = readInt();
      }
      
      long ans;
      foreach (p; 0 .. 1 << (4 * K)) {
        auto ns = new int[K];
        foreach (i; 0 .. K) {
          ns[i] = (p >> (4 * i)) & 15;
        }
        if (iota(K).map!(i => (ns[i] <= N[i])).all) {
          int sumX, sumY;
          foreach (i; 0 .. K) {
            sumX += X[i] * ns[i];
            sumY += Y[i] * ns[i];
          }
          if (GX == sumX && GY == sumY) {
            long tmp = 1;
            int lot = ns.sum;
            foreach (i; 0 .. K) {
              tmp *= binom[lot][ns[i]];
              tmp %= MO;
              lot -= ns[i];
            }
            ans += tmp;
            ans %= MO;
          }
        }
      }
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}