#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
const int mod = 998244353;
struct node {
  int l;
  int r;
  friend bool operator<(const node &a, const node &b) {
    if (a.r == b.r) return a.l < b.l;
    return a.r < b.r;
  }
};
vector<node> g[40];
vector<node> v[40];
int n, k, m;
int pos, maxx;
long long dp[500005], sum[5000005], ret;
long long ans = 1;
bool cmp(const node &a, const node &b) {
  if (a.l == b.l) return a.r < b.r;
  return a.l < b.l;
}
void divide(int l, int r, int val) {
  int _ind = 1;
  while (val) {
    if (val & 1) {
      g[_ind].push_back((node){l, r});
    } else {
      v[_ind].push_back((node){l, r});
    }
    val >>= 1;
    _ind++;
  }
  for (int i = _ind; i <= k; i++) {
    v[i].push_back((node){l, r});
  }
}
void init(int _ind) {
  for (int i = 0; i <= n + 1; i++) {
    dp[i] = -1;
    sum[i] = 0;
  }
  dp[0] = sum[0] = 1;
  maxx = 0;
  pos = 0;
  for (int i = 0, sz = g[_ind].size(); i < sz; i++) {
    if (pos < g[_ind][i].l) pos = g[_ind][i].l;
    while (pos <= g[_ind][i].r) {
      dp[pos] = 0;
      pos++;
    }
  }
  pos = 0;
}
long long solve(int _ind) {
  init(_ind);
  dp[0] = 1;
  sum[0] = 1;
  int sz = v[_ind].size();
  long long ret;
  for (int i = 1; i <= n + 1; i++) {
    if (dp[i] == -1) {
      dp[i] = 0;
      while (pos < sz && v[_ind][pos].r < i) {
        maxx = max(v[_ind][pos].l, maxx);
        pos++;
      }
      if (maxx == 0)
        dp[i] = sum[i - 1];
      else
        dp[i] = (sum[i - 1] - sum[maxx - 1] + mod) % mod;
      ret = dp[i];
    }
    sum[i] = (sum[i - 1] + dp[i]) % mod;
  }
  return ret;
}
signed main() {
  scanf("%d %d %d", &n, &k, &m);
  for (int i = 1; i <= m; i++) {
    int l, r, x;
    scanf("%d %d %d", &l, &r, &x);
    divide(l, r, x);
  }
  for (int i = 1; i <= k; i++) {
    sort(v[i].begin(), v[i].end());
    sort(g[i].begin(), g[i].end(), cmp);
  }
  for (int i = 1; i <= k; i++) ans = ans * solve(i) % mod;
  cout << ans;
  return 0;
}
