#include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <utility>
#include <numeric>

using namespace std;

const int mod = 1e9 + 7;

int calc(vector<int> uses) {
	int sum = accumulate(uses.begin(), uses.end(), 0);
	vector<int> nums;
	for (int i = sum; i > 1; i--) {
		nums.emplace_back(i);
	}

	for (auto e : uses) {
		for (int i = e; i > 1; i--) {
			int tmp = i;
			for (int j = 0; j < nums.size(); j++) {
				int gcd = __gcd(tmp, nums[j]);
				nums[j] /= gcd;
				tmp /= gcd;
				if (tmp == 1) {
					break;
				}
			}
		}
	}

	long long ret = 1;
	for (auto e : nums) {
		ret = (ret * e) % mod;
	}

	return ret;
}


int main() {
	int gx, gy, k;
	cin >> gx >> gy >> k;

	int limit = 1;
	vector<int> x(k), y(k), n(k);
	for (int i = 0; i < k; i++) {
		cin >> x[i] >> y[i] >> n[i];
		limit *= n[i] + 1;
	}

	long long ans = 0;
	for (int i = 0; i < limit; i++) {
		int tmp = i;
		int pos_x = 0;
		int pos_y = 0;

		vector<int> uses(k, 0);

		for (int j = 0; j < k; j++) {
			uses[j] = tmp % (n[j] + 1);
			pos_x += uses[j] * x[j];
			pos_y += uses[j] * y[j];
			tmp /= (n[j] + 1);
		}
		if (pos_x != gx || pos_y != gy) {
			continue;
		}

		// cout << calc(uses) << endl;
		ans = (ans + calc(uses)) % mod;
	}

	cout << ans << endl;
	return 0;
}