#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 100;

int l,h,K;
vector<int> x,y,cnt;
ll ans;

ll inv[MAX_N],fac[MAX_N],finv[MAX_N];

void make()
{
	fac[0] = fac[1] = 1;
	finv[0] = finv[1] = 1;
	inv[1] = 1;
	for(int i=2;i<MAX_N;i++){
		inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
		fac[i] = fac[i-1] * (ll) i % MOD;
		finv[i] = finv[i-1] * inv[i] % MOD;
	}
}

void dfs(vector<int>& vec,int depth)
{
    if(depth == K){
        ll gx=0,gy=0;
        rep(i,K){
            gx += (ll)x[i]*vec[i];
            gy += (ll)y[i]*vec[i];
        }
        if(gx == l && gy == h){
            int sm = accumulate(all(vec),0);
            ll res = fac[sm];
            rep(i,K){
                res = res * finv[vec[i]] % MOD;
            }
            ans = (ans + res) % MOD;
        }
    }else{
        rep(i,cnt[depth]+1){
            vec[depth] = i;
            dfs(vec,depth+1);
        }
    }
}

int main()
{
    cin >> l >> h >> K;
    rep(i,K){
        int a,b,c;
        cin >> a >> b >> c;
        x.pb(a),y.pb(b),cnt.pb(c);
    }
    ans = 0;
    make();
    vector<int> v(K,0);
    dfs(v,0);
    cout << ans << endl;
    return 0;
}