using System; using static System.Console; using System.Linq; using System.Collections.Generic; class Program { static int NN => int.Parse(ReadLine()); static int[] NList => ReadLine().Split().Select(int.Parse).ToArray(); static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray(); public static void Main() { Solve(); } static void Solve() { var c = NList; var (gx, gy, k) = (c[0], c[1], c[2]); var map = NArr(k); var bitmax = 1; foreach (var mi in map) bitmax *= mi[2] + 1; var mod = 1_000_000_007; var ncr = new NCR(75, mod); var ans = 0L; for (var b = 0; b < bitmax; ++b) { var cx = 0; var cy = 0; var tmp = b; var allcount = 0; foreach (var mi in map) { var count = tmp % (mi[2] + 1); allcount += count; cx += mi[0] * count; cy += mi[1] * count; tmp /= mi[2] + 1; } var sub = 1L; if (cx == gx && cy == gy) { var rest = allcount; tmp = b; foreach (var mi in map) { var count = tmp % (mi[2] + 1); sub = sub * ncr.Calc(rest, count) % mod; rest -= count; tmp /= mi[2] + 1; } ans = (ans + sub) % mod; } } WriteLine(ans); } class NCR { int[] facts; int[] revFacts; int mod; public NCR(int n, int mod) { facts = new int[n + 1]; revFacts = new int[n + 1]; this.mod = mod; facts[0] = 1; var tmp = 1L; for (var i = 1; i <= n; ++i) { tmp = tmp * i % mod; facts[i] = (int)tmp; } tmp = Exp(facts[n], mod - 2); revFacts[n] = (int)tmp; for (var i = n; i > 1; --i) { tmp = tmp * i % mod; revFacts[i - 1] = (int)tmp; } revFacts[0] = 1; } public long Exp(long n, long k) { n = n % mod; if (k == 0) return 1; if (k == 1) return n; var half = Exp(n, k / 2); var result = half * half % mod; return ((k % 2) == 0) ? result : (result * n % mod); } public long Calc(int n, int r) { return (long)facts[n] * revFacts[r] % mod * revFacts[n - r] % mod; } /// nが大きくrが小さい場合の計算 public long Calc2(int n, int r) { var tmp = 1L; for (var i = 0; i < r; ++i) { tmp = tmp * (n - i) % mod; } return tmp * revFacts[r] % mod; } public long NPR(int n, int r) { return (long)facts[n] * revFacts[n - r] % mod; } public long Fact(int n) { return facts[n]; } public long RevFact(int n) { return revFacts[n]; } public long Inverse(int n) { return (long)revFacts[n] * facts[n - 1] % mod; } } }