#include <bits/stdc++.h>
using namespace std;
template <typename T>
using Vec = std::vector<T>;
const int MOD = 998244353;
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(0);
  std::cout.tie(0);
  int n, k, m;
  cin >> n >> k >> m;
  Vec<int> l(m), r(m), x(m);
  for (int i = 0; i < (m); ++i) {
    cin >> l[i] >> r[i] >> x[i];
  }
  int ans = 1;
  for (int i = 0; i < (k); ++i) {
    Vec<int> prefix_sum(n + 2, 0);
    Vec<int> max_l(n + 2, 0);
    Vec<int> dp(n + 2, 0);
    for (int j = 0; j < (m); ++j) {
      if (x[j] >> i & 1) {
        prefix_sum[l[j]] += 1;
        prefix_sum[r[j] + 1] -= 1;
      } else {
        max_l[r[j]] = std::max(max_l[r[j]], l[j]);
      }
    }
    for (int j = (1); j < (n + 2); ++j) {
      prefix_sum[j] += prefix_sum[j - 1];
    }
    for (int j = (1); j < (n + 1); ++j) {
      max_l[j] = std::max(max_l[j], max_l[j - 1]);
    }
    dp[0] = 1;
    for (int j = (1); j < (n + 2); ++j) {
      if (prefix_sum[j] == 0) {
        if (max_l[j - 1] == 0) {
          dp[j] = (2LL * dp[j - 1]) % MOD;
        } else {
          dp[j] = (2LL * dp[j - 1] - dp[max_l[j - 1] - 1] + MOD) % MOD;
        }
      } else {
        dp[j] = dp[j - 1];
      }
    }
    dp[n + 1] = (dp[n + 1] - dp[n] + MOD) % MOD;
    ans = (1LL * ans * dp[n + 1]) % MOD;
  }
  cout << ans % MOD << endl;
  return 0;
}
