#include<cstdio>
#include<vector>


using namespace std;
using vi=vector<int>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using ll=long long;

#define MOD 1000000007

struct c_t
{
	int x, y, n;
};


ll mod_pow(ll a, ll b)
{
	ll r=1;

	for(;b>0;b>>=1)
	{
		if(b&1) r=(r*a)%MOD;
		a=(a*a)%MOD;
	}
	return r;
}


ll mod_inv(ll a)
{
	return mod_pow(a, MOD-2);
}


ll mod_fact(int n)
{
	ll r=1;

	for(;n>0;n--)
	{
		r=(r*n)%MOD;
	}
	return r;
}


ll calc(vi&ans)
{
	int k=ans.size();
	int n=0;
	ll u=1, l=1, r;

	for(int i=0;i<k;i++)
	{
		l=(l*mod_fact(ans[i]))%MOD;
		n+=ans[i];
	}
	u=mod_fact(n);

	r=(u*mod_inv(l))%MOD;
//	printf("u=%lld  l=%lld  r=%lld\n", u, l, r);

	return r;
}


int main(void)
{
	int gx, gy, k;
	int offset_x=750000;

	while(scanf("%d%d%d", &gx, &gy, &k)==3)
	{
		vector<c_t> c(k);
		int max_x=0, min_x=0;

		for(int i=0;i<k;i++)
		{
			scanf("%d%d%d", &c[i].x, &c[i].y, &c[i].n);
			max_x=max(max_x, max_x+c[i].x*c[i].n);
			min_x=min(min_x, min_x+c[i].x*c[i].n);
			offset_x=-min_x;
		}
		vvvi dp(max_x-min_x+1), w;
		dp[offset_x].resize(1);
		dp[offset_x][0].resize(k);
		for(int i=0;i<k;i++)
		{
			w=dp;
			for(int x=0;x<w.size();x++)
			{
				if(!w[x].size()) continue;
				for(int j=0;j<w[x].size();j++)
				{
					for(int l=1;l<=c[i].n;l++)
					{
						vi t=w[x][j];
						t[i]=l;
						int nx=x+c[i].x*l;
						dp[nx].push_back(t);
					}
				}
			}
		}

		vvi&dpe=dp[gx+offset_x];
		ll ans=0;
		for(int i=dpe.size()-1;i>=0;i--)
		{
			int y=0;
			for(int j=0;j<k;j++)
			{
				y+=dpe[i][j]*c[j].y;
			}
			if(y==gy)
			{
				ans=(ans+calc(dpe[i]))%MOD;
/*
				for(int j=0;j<k;j++)
				{
					printf("%d ", dpe[i][j]);
				}
				printf("\n");
*/
			}
		}
		printf("%lld\n", ans);
	}
	return 0;
}