#define ONLINE_JUDGE
#include<bits/stdc++.h>

#define HEAP priority_queue
#define rep(i, n) for(int i = 0, _end_ = (n); i < _end_; ++i)
#define per(i, n) for(int i = (n) - 1; i >= 0 ; --i)
#define forn(i, l, r) for(int i = (l), _end_ = (r); i <= _end_; ++i)
#define nrof(i, r, l) for(int i = (r), _end_ = (l); i >= _end_; --i)
#define FOR(a, b) for(auto (a): (b))
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define X first
#define Y second
#define eps 1e-6
#define pi 3.1415926535897932384626433832795
#define SZ(x) (int)x.size()
#define ALL(x) x.begin(), x.end()
#define FILL(a, b) memset((a), (b), sizeof((a)))
#define MCPY(a, b) memcpy((a), (b), sizeof((b)))

using namespace std;

typedef long long LL;
typedef double flt;
typedef vector<int> vi;
typedef vector<LL> vl;
typedef pair<int,int> pii;
typedef pair<int,LL> pil;
typedef pair<LL,int> pli;
typedef pair<LL,LL> pll;
typedef vector<pil> vil;
typedef vector<pii> vii;
typedef vector<pli> vli;
typedef vector<pll> vll;

const int iinf = 1e9 + 7;
const int oo = 0x3f3f3f3f;
const LL linf = 1ll << 60;
const flt dinf = 1e60;

template <typename T>
inline void scf(T &x)
{
	bool f = 0; x = 0; char c = getchar();
	while((c < '0' || c > '9') && c != '-') c = getchar();
	if(c == '-') { f = 1; c = getchar(); }
	while(c >= '0' && c <= '9') { x = x * 10 + c - '0'; c = getchar(); }
	if(f) x = -x; return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) { scf(x); return scf(y); }
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) { scf(x); scf(y); return scf(z); }
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) { scf(x); scf(y); scf(z); return scf(w); }

inline char mygetchar(){ char c = getchar(); while(c == ' ' || c == '\n') c = getchar(); return c; }

template <typename T> inline bool chkmax(T &x, const T &y){ return y > x ? x = y, 1 : 0; }
template <typename T> inline bool chkmin(T &x, const T &y){ return y < x ? x = y, 1 : 0; }

#ifdef ONLINE_JUDGE
#define debug(...) ;
#else
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define DEBUG
#endif

//---------------------------------------------------------head----------------------------------------------------

const LL mod = 1e9 + 7;

int n, m, K;
LL dp[21][1 << 19], pd[1 << 19][21];
int lim[21][21], pw2[21];

inline void ADD(int &x, const int &y)
{
	x = (x + y < mod) ? (x + y) : (x + y - mod);
	return;
}

inline int lowbit(const int &i){ return i & (-i); }

void trans(int i)
{
	rep(s, 1 << n)
	{
		memset(pd[s], 0, sizeof(pd[s][0]) * (n + 1));
		bool f = 1;
		rep(j, n) if(~lim[i][j] && ((s >> j) & 1) != lim[i][j]){ f = 0; break; }
		pd[s][0] = (f ? dp[i - 1][s] : 0);
	}
	LL tmp;
	rep(i, n) rep(s, 1 << n) if(tmp = pd[s][i]) 
	{
//		debug("pd[%d][%d] = %d\n", s, i, pd[s][i]);
		if(!((s >> i) & 1))
		{
			int t = pw2[n] ^ pw2[i + 1];//;(1 << i + 1) - 1;
			t &= s;
//			debug("%d ADD: %d -> %d\t%d\n", i, s, s ^ lowbit(t) | (1 << i), t);
			pd[s ^ lowbit(t) | (1 << i)][i + 1] += tmp;
//			ADD(pd[s ^ lowbit(t) | (1 << i)][i + 1], tmp);
		}
		pd[s][i + 1] += tmp;
//		ADD(pd[s][i + 1], tmp);
	}
	rep(s, 1 << n) dp[i][s] = pd[s][n] % mod;
	return;
}

int main()
{
	rep(i, 21) pw2[i] = (1 << i) - 1;
	scf(n, m, K);
	memset(lim, -1, sizeof lim);
	rep(i, K)
	{
		int x, y; scf(x, y);
		scf(lim[x][y - 1]);
	}
	--n;
	rep(s, 1 << n) dp[0][s] = 1;
	forn(i, 1, m) trans(i);
	printf("%lld\n", dp[m][(1 << n) - 1] % mod);
	return 0;
}

Measured memory_bytes: 172416