#include <bits/stdc++.h>
using namespace std;
int n, m, k;
pair<pair<int, int>, int> req[500005];
int ops[500005];
long long dp[500005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cin >> n >> k >> m;
  for (int i = 0; i < (signed)(m); i++) {
    cin >> req[i].first.second >> req[i].first.first >> req[i].second;
  }
  sort(req, req + m);
  long long ans = 1;
  for (int bt = 0; bt < (signed)(k); bt++) {
    memset(ops, 0, sizeof ops);
    for (int i = 0; i < (signed)(m); i++) {
      if (req[i].second & (1 << bt)) {
        ops[req[i].first.second]++;
        ops[req[i].first.first + 1]--;
      }
    }
    memset(dp, 0, sizeof dp);
    int lb = 0;
    int cur = 0;
    int cc = 0;
    long long csm = 1;
    dp[0] = 1;
    for (int i = (1); i <= (signed)(n); i++) {
      cc += ops[i];
      if (cc == 0) {
        dp[i] = csm;
        csm = (csm + dp[i]) % 998244353LL;
      }
      while (cur < m && req[cur].first.first == i) {
        if (!((1 << bt) & req[cur].second)) {
          int olb = lb;
          lb = max(lb, req[cur].first.second);
          for (int i = (olb); i <= (signed)(lb - 1); i++) {
            csm = (csm + 998244353LL - dp[i]) % 998244353LL;
          }
        }
        ++cur;
      }
    }
    long long tot = csm;
    ans = (ans * tot) % 998244353LL;
  }
  cout << ans << "\n";
  return 0;
}
