#include <bits/stdc++.h>
using namespace std;
#define int long long
#define MOD 1000000007

int Gx, Gy, K;
int x[7], y[7], N[7];
vector<int> fact = {1};

int mod_pow(int a, int n) {
    int res = 1;
    
    while (n>0) {
        if (n&1) {
            res = res*a%MOD;
        }
        
        a = a*a%MOD;
        n >>= 1;
    }
    
    return res;
}

int dfs(int d, stack<int> s) {
    if (d==K) {
        int xs = 0;
        int ys = 0;
        int ss = 0;
        vector<int> vec;
        
        for (int i=0; i<K; i++) {
            int si = s.top(); s.pop();
            xs += x[K-1-i]*si;
            ys += y[K-1-i]*si;
            ss += si;
            vec.push_back(si);
        }
        
        if (xs==Gx && ys==Gy) {
            int res = fact[ss];
            
            for (auto& vec_i : vec) {
                res *= mod_pow(fact[vec_i], MOD-2);
                res %= MOD;
            }
            
            return res;
        }
        else {
            return 0;
        }
    }
    
    int res = 0;
    
    for (int i=0; i<=N[d]; i++) {
        s.push(i);
        res += dfs(d+1, s);
        res %= MOD;
        s.pop();
    }
    
    return res;
}

signed main() {
    cin >> Gx >> Gy >> K;
    
    for (int i=0; i<K; i++) {
        cin >> x[i] >> y[i] >> N[i];
    }
    
    for (int i=1; i<100; i++) {
        fact.push_back(fact.back()*i%MOD);
    }
    
    stack<int> s;
    
    cout << dfs(0, s) << endl;
}