#define  _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <algorithm>
#include <utility>
#include <functional>
#include <cstring>
#include <queue>
#include <stack>
#include <math.h>
#include <iterator>
#include <vector>
#include <string>
#include <set>
#include <math.h>
#include <iostream> 
#include<map>
#include <iomanip>
#include <time.h>
#include <random>
#include <stdlib.h>
#include <list>
#include <typeinfo>
#include <list>
#include <set>
using namespace std;
#define LONG_INF 10000000000000000
#define MAX_MOD 1000000007
#define REP(i,n) for(long long i = 0;i < n;++i)
long long kaijo[10000] = {};
long long solve(long long n) {
	if (kaijo[n]) return kaijo[n];
	return (n*solve(n - 1))%MAX_MOD;
}
long long gyaku[10000] = {};
int main() {
	gyaku[0] = 1;
	gyaku[1] = 1;
	for (int i = 2;i < 10000;++i) {
		gyaku[i] = gyaku[MAX_MOD%i] * (MAX_MOD - MAX_MOD / i) % MAX_MOD;
	}
	kaijo[1] = 1;
	int gx, gy, k;
	cin >> gx >> gy >> k;
	vector<vector<int>> wow[6];
	vector<int> hoge;
	wow[0].push_back(hoge);
	vector<pair<int, int>> magic;
	for (int i = 0;i < k;++i) {
		int x, y, n;
		cin >> x >> y >> n;
		magic.push_back(make_pair(x, y));
		for (int j = 0;j < wow[i].size();++j) {
			for (int q = 0;q <= n;++q) {
				vector<int> hogehoge = wow[i][j];
				hogehoge.push_back(q);
				wow[i + 1].push_back(hogehoge);
			}
		}
	}
	long long ans = 0;
	for (int i = 0;i < wow[k].size();++i) {
		int xs=0, ys=0,sum=0;
		for (int j = 0;j < wow[k][i].size();++j) {
			xs += wow[k][i][j] * magic[j].first;
			ys += wow[k][i][j] * magic[j].second;
			sum += wow[k][i][j];
		}
		if (xs == gx&&ys == gy) {
			long long nya = solve(sum);
			for (int j = 0;j < wow[k][i].size();++j) {
				nya *= gyaku[wow[k][i][j]];
				nya %= MAX_MOD;
			}
			ans += nya;
			ans %= MAX_MOD;
		}
	}
	cout << ans << endl;
	return 0;
}