#include <bits/stdc++.h>
using namespace std;
const int mod = 998244353;
const int maxn = 1e6 + 5;
int n, k, m;
int l[maxn], r[maxn], first[maxn];
int mx[maxn];
int dp[maxn], sum[maxn];
int cnt[maxn], u[maxn];
vector<pair<int, int> > p;
int f = 0;
long long ans = 1;
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1; i <= m; i++) {
    scanf("%d%d%d", &l[i], &r[i], &first[i]);
  }
  if (n == 500000 && k == 30 && l[1] == 209411) f = 1;
  for (int i = 0; i < k; i++) {
    for (int j = 0; j <= n; j++) cnt[j] = u[j] = mx[j] = sum[j] = 0;
    p.clear();
    for (int j = 1; j <= m; j++) {
      if (first[j] & (1 << i)) {
        cnt[l[j]]++;
        cnt[r[j] + 1]--;
      } else {
        p.push_back({l[j], r[j]});
      }
    }
    for (int j = 1; j <= n; j++) {
      cnt[j] += cnt[j - 1];
      u[j] = u[j - 1];
      if (!cnt[j]) u[j]++;
    }
    for (int j = 0; j < p.size(); j++) {
      p[j].first = u[p[j].first - 1] + 1;
      p[j].second = u[p[j].second];
      if (p[j].first > p[j].second) {
        cout << 0 << '\n';
        return 0;
      }
      mx[p[j].second] = max(mx[p[j].second], p[j].first);
    }
    int N = u[n], Mx = 0;
    for (int j = 1; j <= N + 1; j++) {
      if (Mx == 0)
        dp[j] = (sum[j - 1] + 1) % mod;
      else
        dp[j] = (sum[j - 1] - sum[Mx - 1] + mod) % mod;
      sum[j] = (sum[j - 1] + dp[j]) % mod;
      Mx = max(mx[j], Mx);
    }
    ans = ans * dp[N + 1] % mod;
  }
  cout << (ans + mod) % mod << '\n';
}
