#include <bits/stdc++.h>
using namespace std;
int n, k, m;
const int maxn = 5e5 + 100;
const int mod = 998244353;
struct node {
  long long l, r, x;
} save[maxn];
long long dp[maxn], sum[maxn], mx[maxn], sub[maxn];
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%lld%lld%lld", &save[i].l, &save[i].r, &save[i].x);
  }
  long long res = 1;
  for (int kk = 0; kk < k; kk++) {
    memset(sub, 0, sizeof(sub));
    memset(mx, 0, sizeof(mx));
    memset(dp, 0, sizeof(dp));
    memset(sum, 0, sizeof(sum));
    dp[0] = 1;
    sum[0] = 1;
    int tmp = 1 << kk;
    for (int i = 1; i <= m; i++) {
      if (save[i].x & tmp) {
        sub[save[i].l]++;
        sub[save[i].r + 1]--;
      } else {
        mx[save[i].r] = max(mx[save[i].r], save[i].l);
      }
    }
    for (int i = 1; i <= n; i++) sub[i] = sub[i] + sub[i - 1];
    int p = 0;
    for (int i = 1; i <= n; i++) {
      sum[i] = sum[i - 1];
      if (sub[i] == 0) {
        dp[i] = sum[i - 1] % mod;
        sum[i] += dp[i];
        sum[i] %= mod;
      }
      while (p < mx[i]) sum[i] = (sum[i] - dp[p]) % mod, p++;
    }
    res *= sum[n];
    res %= mod;
    res += mod;
    res %= mod;
  }
  printf("%I64d", res);
  return 0;
}
