#include <algorithm>
#include <cstring>
#include <cstdio>
#include <vector>
#include <map>
#define mod 998244353
#define popc __builtin_popcount
using namespace std;
typedef long long ll;
const int N = 55, Q = 15, S = 1024;map<int, int> ix, iy;
int n, k, c, m, q, a[Q][Q], C[N][N], f[N][N][S];
void add(int& x, int y){x += y;if (x >= mod) x -= mod;}
inline void mul(int& x, int y){x = 1ll * x * y % mod;}
int qpow(int bse, int p){int ans = 1;for (;p;p >>= 1, mul(bse, bse)) if (p & 1) mul(ans, bse);return ans;}
void tsum(int x, int y){
	for (int o = 0;o < m;o ++)
	for (int i = 0;i < 1 << m;i ++)
	if (i >> o & 1) add(f[x][y][i], f[x][y][i ^ 1 << o]);
}
int main(){scanf("%d%d%d", &n, &k, &q);
	for (int i = 0;i <= n;i ++){C[i][0] = 1;
	for (int j = 1;j <= n;j ++) add(C[i][j] = C[i - 1][j], C[i - 1][j - 1]);}
	for (int x, y, z;q --;){scanf("%d%d%d", &x, &y, &z);
		if (ix.find(x) == ix.end()) ix[x] = ++ c;x = ix[x];
		if (iy.find(y) == iy.end()) iy[y] = ++ m;y = iy[y];
		a[x][y] = z;
	}f[0][0][0] = 1, tsum(0, 0);
	for (int i = 1;i <= n;i ++)
	for (int j = 0;j <= n - m;j ++){
		for (int k = 0;k <= j;k ++)
		for (int s = 0;s < 1 << m;s ++)
		add(f[i][j][s], 1ll * C[n - m - k][j - k] * f[i - 1][k][s] % mod);
		for (int s = 0;s < 1 << m;s ++){
			for (int x = 1;x <= c;x ++){int cnt = j - i + 1, ps = 0;
				for (int y = 1;y <= m;y ++){
					if (s >> y - 1 & 1) cnt += !a[x][y];
					if (a[x][y] && a[x][y] < i) cnt ++;
					if (a[x][y] == i) ps = y;
				}
				if (ps){if (s >> ps - 1 & 1 ^ 1){f[i][j][s] = 0;goto Nxt;}}
				else if (cnt <= 0){f[i][j][s] = 0;goto Nxt;}
				else mul(f[i][j][s], cnt);
			}mul(f[i][j][s], qpow(max(j - i + 1 + popc(s), 0), k - c));Nxt:;
		}tsum(i, j);
	}printf("%d\n", f[n][n - m][(1 << m) - 1]);
}