import java.util.Arrays;
import java.util.Scanner;

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

	static void sample() {
		System.out.println(1 + " " + 1 + " " + 5);
		for (int i = 0; i < 5; i++) {
			System.out.println(1 + " " + 1 + " " + 15);
		}
	}

	static long MOD = 1_000_000_000 + 7;

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

		long[] x = new long[k];
		long[] y = new long[k];
		long[] n = new long[k];
		for (int i = 0; i < k; i++) {
			x[i] = sc.nextLong();
			y[i] = sc.nextLong();
			n[i] = sc.nextInt();
		}

		memo = new long[(int) ((Math.pow(15, k)) + 1) * 15];
		Arrays.fill(memo, -1);
		long ans = dp(0, 0, x, y, n, gx, gy);
		System.out.println(ans);
	}

	static long[] memo;

	static long dp(long curx, long cury, long[] x, long[] y, long[] n, long gx, long gy) {
		int idx = 0;
		for (int i = 0; i < n.length; i++) {
			idx += Math.pow(15, i) * n[i];
		}
		if (idx == 0)
			return 0;
		if (memo[idx] != -1) {
			return memo[idx];
		} else {
			long sum = 0;
			for (int i = 0; i < n.length; i++) {
				if (n[i] > 0) {
					long[] d = Arrays.copyOf(n, n.length);
					d[i]--;
					long nx = curx + x[i];
					long ny = cury + y[i];
					if (gx == nx && gy == ny) {
						sum += 1;

					}
					sum += dp(nx, ny, x, y, d, gx, gy);
					sum %= MOD;
				}
			}
			memo[idx] = sum % MOD;
			return sum;
		}
	}
}