#include<bits/stdc++.h>

using namespace std;

int table[100008][2];

struct sloup{
	int maxi=-1;
	int mini=10;
	int soucet=-1;
	int dva=0;
	int jedna=0;
	int nula=0;
};

long long moc[11][132456];

long long na(int a, int b){
	return moc[a][b];
}

int main(){
	int n,k,m;
	cin>>n>>k>>m;
	int a,b, cislo;
	for(int i=0;i<n;i++){
		for(int j=0;j<2;j++){
			table[i][j]=-1;
		}
	}
	for(int i=0;i<m;i++){
		cin>>a>>b>>cislo;
		table[a][b] = cislo;
	}

	sloup slpc[3];

	long long mod = 1e9+7;

	for(int i = 1; i <= 10; i++)
	{
		moc[i][0] = 1;
		for(int j = 1; j < 123456; j++)
			moc[i][j] = (moc[i][j-1]*i)%mod;
	}

	for(int i=0;i<n;i++){
		if(table[i][0]==-1 && table[i][1]==-1){
			slpc[i%3].nula++;
		} 
		else if(table[i][0]==-1 || table[i][1]==-1){
			slpc[i%3].jedna++;
			
			if(table[i][0]==-1){
				if(table[i][1]>slpc[i%3].maxi){slpc[i%3].maxi = table[i][1];}
				if(table[i][1]<slpc[i%3].mini){slpc[i%3].mini=table[i][1];}
			}
			
			else{
				if(table[i][0]>slpc[i%3].maxi){slpc[i%3].maxi = table[i][0];}
				if(table[i][0]<slpc[i%3].mini){slpc[i%3].mini=table[i][0];}
			}
		}
		else{
			slpc[i%3].dva++;
			int suma = table[i][0]+table[i][1];
			if(slpc[i%3].soucet!= -1 && slpc[i%3].soucet!=suma){cout<<0<<endl;return 0;}
			slpc[i%3].soucet = suma;
		}

	}
	
	long long vrat = 0, mezi;
	int possible[]={1,2,3,4,5,6,7,8,9,10,9,8,7,6,5,4,3,2,1};
	long long prv = 1000000007;
	
	//cout<<"stlp[0] "<<slpc[0].nula<<", "<<slpc[0].jedna<<", "<<slpc[0].dva<<" maxi,mini "<<slpc[0].maxi<<" "<<slpc[0].mini<<endl;
	
	for(int k1=0;k1<19;k1++){
		for(int k2=0;k2<19;k2++){
			for(int k3=0;k3<19;k3++){
				if(k1+k2+k3==k){
					if(slpc[0].soucet!=-1 && slpc[0].soucet!=k1){continue;}
					if(slpc[1].soucet!=-1 && slpc[1].soucet!=k2){continue;}
					if(slpc[2].soucet!=-1 && slpc[2].soucet!=k3){continue;}
					
					if(slpc[0].mini!=10 && k1-slpc[0].mini>9){continue;}
					if(slpc[1].mini!=10 && k2-slpc[1].mini>9){continue;}
					if(slpc[2].mini!=10 && k3-slpc[2].mini>9){continue;}

					if(slpc[0].maxi!=-1 && k1-slpc[0].maxi<0){continue;}
					if(slpc[1].maxi!=-1 && k2-slpc[1].maxi<0){continue;}
					if(slpc[2].maxi!=-1 && k3-slpc[2].maxi<0){continue;}
					
					//cout<<"zkousim "<<k1<<" "<<k2<<" "<<k3<<" mezi jsou ";	

					mezi =  na(possible[k1],slpc[0].nula);
					//cout<<mezi<<" ";
					mezi%=prv;
					mezi *= na(possible[k2], slpc[1].nula);
					mezi%=prv;
					//cout<<mezi<<" ";
					mezi *= na(possible[k3], slpc[2].nula);
					mezi%=prv;
					//cout<<mezi<<endl;
					
					vrat+=mezi;
					vrat%=prv;
				}
			}
		}
	}
	cout<<vrat<<endl;


	return 0;
}