/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.04 23:12:21
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

constexpr int MOD = 1e9 + 7;
struct mint {
private:
    long long x;
public:
    mint(long long x = 0) :x((MOD+x)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
};
int gx,gy,k;
vector<tuple<int,int,int>> a;
mint ans;

struct Combination {
private:
    int N;
    
    mint pow(mint k, ll n) {
        mint res = 1;
        while (n > 0) {
            if (n & 1) {
                res *= k;
            }
            k *= k;
            n >>= 1;
        }
        return res;
    }
public:
    vector< mint > FACT, IFACT;
    
    Combination(int n) : N(n) {
        FACT.resize(n + 1);
        IFACT.resize(n + 1);
        FACT[0] = 1;
        IFACT[0] = 1;
        for (int i = 1; i <= n; i++) {
            FACT[i] = FACT[i - 1] * i;
            IFACT[i] = pow(FACT[i], MOD - 2);
        }
    }
    mint comb(int n, int r) {
        if (n < 0 || r < 0 || r > n) return 0;
        if (r > n / 2) r = n - r;
        return FACT[n] * IFACT[n - r] * IFACT[r];
    }
};
void dfs(int t,vector<int> &v,Combination &cb) {
    if (t == k - 1) {
        int x = 0, y = 0;
        mint res = 1;
        int cnt = 0;
        for (int i = 0; i < k; i++) {
            x += get<0>(a[i]) * v[i];
            y += get<1>(a[i]) * v[i];
            cnt += v[i];
            res *= cb.IFACT[v[i]];
        }
        res *= cb.FACT[cnt];
        if (x == gx && y == gy) {
            ans += res;
        }
    }
    else {
        for (int i = 0; i <= get<2>(a[t + 1]); i++) {
            v.push_back(i);
            dfs(t+1,v,cb);
            v.pop_back();
        }
    }
}
int main() {
    cin >> gx >> gy >> k;
    a.resize(k);
    Combination cb(75);
    for (int i = 0; i < k; i++) {
        int x,y,n;cin >> x >> y >> n;
        a[i] = make_tuple(x,y,n);
    }
    vector<int> v(1);
    for (int i = 0; i <= get<2>(a[0]); i++) {
        v[0] = i;
        dfs(0,v,cb);
    }
    cout << ans << endl;
    return 0;
}