#include <bits/stdc++.h>
using namespace std;
long long n, k, m, l[500005], r[500005], first[500005], p[500005], v[500005],
    dp[500005], predp[500005];
void solve() {
  long long ans = 1;
  cin >> n >> k >> m;
  for (long long i = 0; i < m; i++) cin >> l[i] >> r[i] >> first[i];
  for (long long bit = 0; bit < k; bit++) {
    for (long long i = 1; i < n + 1; i++) {
      p[i] = 0;
      v[i] = 0;
    }
    for (long long i = 0; i < m; i++) {
      if ((first[i] >> bit) & 1)
        p[l[i]]++, p[r[i] + 1]--;
      else
        v[r[i]] = max(v[r[i]], l[i]);
    }
    for (long long i = 1; i < n + 1; i++) p[i] += p[i - 1];
    for (long long i = 1; i < n + 1; i++) p[i] = p[i] > 0;
    for (long long i = 1; i < n + 1; i++) dp[i] = predp[i] = 0;
    dp[0] = 1;
    predp[0] = (p[1] == 0);
    long long cur = 0;
    for (long long i = 1; i < n + 1; i++) {
      if (v[i] <= cur)
        dp[i] = dp[i - 1] * (1 + !p[i]) % 998244353;
      else {
        cur = v[i];
        dp[i] = (predp[i - 1] - (cur >= 2 ? predp[cur - 2] : 0) + 998244353) %
                998244353;
      }
      predp[i] = (predp[i - 1] + (p[i + 1] == 0 ? dp[i] : 0)) % 998244353;
    }
    ans = (ans * dp[n]) % 998244353;
  }
  cout << ans << '\n';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) {
    solve();
  }
  return 0;
}
