#include <bits/stdc++.h>
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
using namespace std;
const long long mo = 998244353;
long long n, k, m, ans = 1;
long long l[500005], r[500005], x[500005];
long long lmx[500005], c[500005], dp[500005];
long long solve(long long S) {
  for (long long i = 1; i <= n; i++) lmx[i] = 0, c[i] = 0, dp[i] = 0;
  for (long long i = 1; i <= m; i++)
    if (x[i] & S)
      ++c[l[i]], --c[r[i] + 1];
    else
      lmx[r[i]] = max(lmx[r[i]], l[i]);
  for (long long i = 1; i <= n + 1; i++)
    lmx[i] = max(lmx[i], lmx[i - 1]), c[i] += c[i - 1];
  long long sum = 1;
  dp[0] = 1;
  for (long long i = 1, j = 0; i <= n + 1; i++) {
    if (c[i] > 0) {
      dp[i] = 0;
      continue;
    }
    while (j < lmx[i - 1]) sum = (sum - dp[j++] + mo) % mo;
    dp[i] = sum;
    sum = (sum + dp[i]) % mo;
  }
  return dp[n + 1];
}
signed main() {
  scanf("%d %d %d", &n, &k, &m);
  for (long long i = 1; i <= m; i++) scanf("%d %d %d", &l[i], &r[i], &x[i]);
  for (long long i = 0; i < k; i++) ans = ans * solve(1 << i) % mo;
  printf("%lld\n", ans);
  return 0;
}
