#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char c;
  long long x = 0;
  long long b = 1;
  do {
    c = getchar();
    if (c == 45) b = -1;
  } while (c > 57 || c < 48);
  do x = x * 10 + c - 48, c = getchar();
  while (c <= 57 && c >= 48);
  x *= b;
  return x;
}
long long n, k, m;
const long long maxn = 5e5 + 5;
const long long mod = 998244353;
long long res = 1, l[maxn], r[maxn], x[maxn], dp[maxn], lst[maxn], dif[maxn];
signed main() {
  n = read(), k = read(), m = read();
  for (long long i = 1; i <= m; i++)
    l[i] = read(), r[i] = read() + 1, x[i] = read();
  for (long long p = 0; p < k; p++) {
    for (long long i = 0; i <= n + 1; i++) lst[i] = dif[i] = dp[i] = 0;
    dp[0] = 1;
    for (long long i = 1; i <= m; i++)
      if (x[i] & (1 << p))
        dif[l[i]]++, dif[r[i]]--;
      else
        lst[r[i]] = max(lst[r[i]], l[i]);
    for (long long i = 2; i <= n + 1; i++)
      dif[i] += dif[i - 1], lst[i] = max(lst[i - 1], lst[i]);
    long long sum = 1, L = 0;
    for (long long i = 1; i <= n + 1; i++) {
      while (L < lst[i]) sum = (mod + sum - dp[L]) % mod, dp[L++] = 0;
      dp[i] = dif[i] ? 0 : sum;
      sum = (sum + dp[i]) % mod;
    }
    res = res * dp[n + 1] % mod;
  }
  cout << res << "\n";
  return 0;
}
