#include <bits/stdc++.h>
using namespace std;
namespace RenaMoe {
template <typename TT>
inline void read(TT &x) {
  x = 0;
  bool f = false;
  char ch = getchar();
  while (!isdigit(ch)) f |= ch == '-', ch = getchar();
  while (isdigit(ch)) x = x * 10 + ch - '0', ch = getchar();
  x = f ? -x : x;
}
const int N = 5e5 + 9;
const int P = 998244353;
int n, k, m, ans;
int a[N], l[N], r[N], one[N], ln[N], f[N];
inline void clear() {
  for (int i = 0; i <= n + 1; ++i) ln[i] = one[i] = f[i] = 0;
}
inline int dp(int x) {
  clear();
  for (int i = 1; i <= m; ++i) {
    if ((a[i] >> x) & 1)
      one[l[i]]++, one[r[i] + 1]--;
    else
      ln[r[i] + 1] = max(ln[r[i] + 1], l[i]);
  }
  for (int i = 1; i <= n + 1; ++i) {
    one[i] += one[i - 1];
    ln[i] = max(ln[i], ln[i - 1]);
  }
  int sum = 1, p = 0;
  f[0] = 1;
  for (int i = 1; i <= n + 1; ++i) {
    while (p < ln[i]) {
      sum = (sum - f[p] + P) % P;
      f[p] = 0;
      p++;
    }
    f[i] = one[i] ? 0 : sum;
    sum = (sum + f[i]) % P;
  }
  return f[n + 1];
}
inline void main() {
  read(n), read(k), read(m);
  for (int i = 1; i <= m; ++i) read(l[i]), read(r[i]), read(a[i]);
  ans = 1;
  for (int i = 0; i < k; ++i) ans = 1ll * ans * dp(i) % P;
  printf("%d\n", ans);
}
}  // namespace RenaMoe
int main() {
  RenaMoe::main();
  return 0;
}
