#include <bits/stdc++.h>
#pragma GCC optimize ("O2,unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;

const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod=1000000007;
const int N=20;

int n, m, k, u, v, x, y, t, a, b, ans;
int dp[1<<N], temp[1<<N];
bool bad[N+1][N+1][2];

inline void fix(int &x){
	if (x>=mod) x-=mod;
	if (x<0) x+=mod;
}

int main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
	//freopen("input.txt", "r", stdin);
	//freopen("output.txt", "w", stdout);
	cin>>n>>m>>k;
	n--;
	while (k--){
		cin>>a>>b>>x;
		bad[a-1][b-1][x^1]=1;
	}
	dp[0]=1;
	for (int i=0; i<m; i++){
		int x=(i&1);
		for (int j=0; j<n; j++){
			memset(temp, 0, sizeof(temp));
			for (int mask=0; mask<(1<<n); mask++){
				if (!bad[i][j][0] && ((mask>>j)&1)==0)
					fix(temp[mask]+=dp[mask]);
				if (!bad[i][j][1]){
					if (mask&(1<<j)) fix(temp[mask]+=dp[mask]);
					else{
						int msk=mask|(1<<j);
						int tmp=mask&(~((1<<j)-1));
						int bit=__builtin_ctz(tmp);
						if (tmp) msk^=(1<<bit);
						fix(temp[msk]+=dp[mask]);
					}
				}
			}
			memcpy(dp, temp, sizeof(dp));
		}
	}
	for (int mask=0; mask<(1<<n); mask++) fix(ans+=dp[mask]);
	cout<<ans<<"\n";
	
	return 0;
}
