import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		solver();
	}

	static long MOD = 1_000_000_000 + 7;

	static void solver() {
		Scanner sc = new Scanner(System.in);
		int gx = sc.nextInt();
		int gy = sc.nextInt();
		int k = sc.nextInt();// the number of kinds of crystals

		P np = new P(-1, -1);
		P[] ps = new P[1 << (4 * k)];
		for (int i = 1; i < ps.length; i++) {
			ps[i] = np;
		}
		ps[0] = new P(0, 0);

		for (int i = 0; i < k; i++) {
			int x = sc.nextInt();
			int y = sc.nextInt();
			P v = new P(x, y);
			int n = sc.nextInt();

			for (int j = 0; n > 0; j++) {
				int mul = Math.min(1 << j, n);
				n -= mul;
				P u = v.multiply(mul);
				for (int l = (1 << (4 * i + j)) - 1 ; l >= 0; l--) {
					if (ps[l] == np)
						continue;
					ps[l + (mul << (4 * i))] = ps[l].add(u);
				}
			}
		}
		long ans = 0;
		for (int i = 0; i < (1 << (4 * k)); i++) {
			if (ps[i] == np)
				continue;
			if (ps[i].x != gx || ps[i].y != gy)
				continue;
			int s = i;
			long total = 0;
			long denomi = 1;
			for (; s > 0; s >>= 4) {
				int d = s & 15;
				total += d;
				denomi = denomi * inv(fact(d), MOD) % MOD;
			}
			ans = (ans + fact(total) * denomi) % MOD;
		}
		System.out.println(ans);
	}

	static class P {
		int x;
		int y;

		P(int x, int y) {
			this.x = x;
			this.y = y;
		}

		P multiply(int m) {
			return new P(x * m, y * m);
		}

		P add(P p) {
			return new P(x + p.x, y + p.y);
		}
	}

	static long fact(long nume) {
		long ans = 1;
		for (int i = 1; i <= nume; i++) {
			ans *= i;
			ans %= MOD;
		}
		return ans;
	}

	static long inv(long a, long mod) {
		a = a % mod;
		long b = mod;
		long p = 1, q = 0;

		while (b > 1) {
			long c = b / a;
			b = b % a;
			q = q - p * c;
			long d = b;
			b = a;
			a = d;
			d = p;
			p = q;
			q = d;
		}
		while (q < 0)
			q += mod;
		return q;
	}
}