#include<bits/stdc++.h>
#define int long long
const int N=10,V=20,Mod=1e9+7; int x,y,k,ans,fac[V],inv[V];
struct Magic { int x,y,n,num; }a[N];
void exgcd(int a,int b,int &x,int &y) {
    if(!b) x=1,y=0;
    else exgcd(b,a%b,y,x),y-=a/b*x;
}
void dfs(int u) {
    if(u==k+1) {
        //for(int i=1;i<=k;i++) std::cout<<a[i].num<<' ';
        //std::cout<<'\n';
        int p=0,q=0,sum=0,tot=1;
        for(int i=1;i<=k;i++) p+=a[i].x*a[i].num,q+=a[i].y*a[i].num,sum+=a[i].num,tot=1ll*tot*inv[a[i].num]%Mod;
        tot=1ll*tot*fac[sum]%Mod;
        //std::cout<<p<<' '<<q<<'\n';
        if(p==x&&q==y) (ans+=tot)%=Mod;
        return;
    }
    for(int i=0;i<=a[u].n;i++) a[u].num=i,dfs(u+1);
}
signed main() {
    //freopen("move.in","r",stdin);
    //freopen("move.out","w",stdout);
    std::ios::sync_with_stdio(false),std::cin.tie(nullptr);
    fac[0]=1;
    for(int i=1;i<=15;i++) fac[i]=1ll*fac[i-1]*i%Mod;
    int X,Y; exgcd(fac[15],Mod,X,Y),inv[15]=(X%Mod)+Mod;
    //std::cout<<inv[15]<<'\n';
    for(int i=14;i>=0;i--) inv[i]=1ll*inv[i+1]*(i+1)%Mod;
    std::cin>>x>>y>>k;
    for(int i=1;i<=k;i++) std::cin>>a[i].x>>a[i].y>>a[i].n;
    dfs(1);
    std::cout<<ans;
    return 0;
}