#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define rep(i, a, n) for (int i = (a); i < (n); i++)
#define per(i, a, n) for (int i = (n) - 1; i >= (a); i--)
#define FOR(i, n) rep(i, 0, (n))
#define fi first
#define se second

char endl = '\n';
int a[100005][2];
long long res;
ll MOD=1000000007;
int main(void) {
    int N,K,M;
    scanf("%i %i %i", &N, &K, &M);
    int i;
    for(i=0;i<100005;i++){
        a[i][0]=-1; a[i][1]=-1;
    }
    for(i=0;i<M;i++){
        int c,d;
        scanf("%i %i", &c, &d);
        scanf("%i", &a[c][d]);
    }
    int j,k;
    int l;
    for(i=0;i<=18;i++){
        for(j=0;j<=18;j++){
            k=K-i-j;
            if(k<0) continue;
            ll aktres=1;
            bool stav=true;
            int p[]={i,j,k};
            for(l=0;l<N;l++){
                if(a[l][0]==-1&&a[l][1]==-1){
                    aktres=(aktres*(10-abs(p[l%3]-9)))%MOD;
                }
                else if(a[l][0]==-1) {
                    if(p[l%3]-a[l][1]>=0&&p[l%3]-a[l][1]<=9) continue;
                    else {stav=false; break;}
                }
                else if(a[l][1]==-1){
                    if(p[l%3]-a[l][0]>=0&&p[l%3]-a[l][0]<=9) continue;
                    else {stav=false; break;}
                }
                else{
                    if(a[l][0]+a[l][1]!=p[l%3]) {stav=false; break;}
                }
            }
            if(!stav) continue;
            res=(res+aktres)%MOD;
        }
    }
    printf("%lld\n", res);
	return 0;
}