#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
using namespace std;
const long long maxn = 5e5 + 100;
const long long mod = 998244353;
long long n, m, k, t;
long long st2[maxn];
long long L[maxn];
long long R[maxn];
long long X[maxn];
vector<long long> open[maxn];
vector<long long> close[maxn];
long long ANS[maxn];
long long solve(long long i) {
  long long q, w, e;
  vector<long long> A(n);
  vector<long long> D(n + 3);
  for (q = 0; q < n; q++) {
    A[q] = ((ANS[q] & st2[i]) != 0);
  }
  long long l = -1, sum = 0;
  D[0] = 0;
  for (q = 0; q < n; q++) {
    if (A[q] != 1) {
      D[q] = sum;
      if (l == -1) {
        D[q]++;
      }
      sum += D[q];
      sum %= mod;
    }
    for (w = 0; w < close[q].size(); w++) {
      if ((X[close[q][w]] & st2[i]) != 0) {
        continue;
      }
      long long ind = close[q][w];
      if (L[ind] > l) {
        while (l < L[ind]) {
          if (l != -1) {
            sum -= D[l];
            sum += mod;
            sum %= mod;
          }
          l++;
        }
      }
    }
  }
  if (l == -1) {
    sum++;
  }
  return sum;
}
int main() {
  long long q, w, e, a, b, c, d;
  ios_base ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  st2[0] = 1;
  for (q = 1; q < 40; q++) {
    st2[q] = st2[q - 1] * 2;
  }
  cin >> n >> k >> m;
  for (q = 0; q < m; q++) {
    cin >> L[q] >> R[q] >> X[q];
    L[q]--;
    R[q]--;
    open[L[q]].push_back(q);
    close[R[q]].push_back(q);
  }
  vector<long long> cnt(k);
  for (q = 0; q < n; q++) {
    for (w = 0; w < open[q].size(); w++) {
      long long first = X[open[q][w]];
      for (e = 0; e < k; e++) {
        if ((st2[e] & first) != 0) {
          cnt[e]++;
        }
      }
    }
    for (w = 0; w < k; w++) {
      if (cnt[w] != 0) {
        ANS[q] += st2[w];
      }
    }
    for (w = 0; w < close[q].size(); w++) {
      long long first = X[close[q][w]];
      for (e = 0; e < k; e++) {
        if ((st2[e] & first) != 0) {
          cnt[e]--;
        }
      }
    }
  }
  long long ans = 1;
  for (q = 0; q < k; q++) {
    ans *= solve(q);
    ans %= mod;
  }
  cout << ans;
  return 0;
}
