#include <bits/stdc++.h>
const int mod = 998244353;
const int N = 1 << 19;
int l[500010], r[500010], x[500010], c[500010], to[500010], s[500010];
int b[N + N], lv[N + N], n, m;
int go(int i) {
  for (int j = 0; j <= n + 2; j++) {
    to[j] = -1;
    c[j] = s[j] = 0;
  }
  for (int j = 0; j < m; j++) {
    if (x[j] >> i & 1) {
      c[l[j]]++;
      c[r[j]]--;
    } else {
      if (to[r[j]] < l[j]) to[r[j]] = l[j];
    }
  }
  int cc = 0, tmp = 0, L = 0;
  s[1] = 1;
  for (int j = 0; j <= n; j++) {
    cc += c[j];
    if (L < to[j] + 1) L = to[j] + 1;
    tmp = s[j + 1] - s[L];
    if (tmp < 0) tmp += mod;
    if (!cc) s[j + 2] = tmp;
    s[j + 2] += s[j + 1];
    if (s[j + 2] >= mod) s[j + 2] -= mod;
  }
  return tmp;
}
int main() {
  int k;
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 0; i < m; i++) {
    scanf("%d%d%d", &l[i], &r[i], &x[i]);
    --l[i];
  }
  int ans = 1;
  for (int i = 0; i < k; i++) {
    ans = (long long)ans * go(i) % mod;
  }
  printf("%d\n", ans);
  return 0;
}
