#include <bits/stdc++.h>
using namespace std;
struct que {
  int l, r, x;
} arr[500005];
int tag[500005], state[500005];
int L[500005];
int dp[500005];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int n, k, m;
  cin >> n >> k >> m;
  for (int i = 1; i <= m; i++) cin >> arr[i].l >> arr[i].r >> arr[i].x;
  int ans = 1;
  for (int bit = 0; bit < k; bit++) {
    int b = (1 << bit);
    memset(tag, 0, sizeof tag);
    memset(L, 0, sizeof L);
    for (int i = 1; i <= m; i++)
      if ((arr[i].x & b) != 0)
        tag[arr[i].l] = max(tag[arr[i].l], arr[i].r);
      else
        L[arr[i].r] = max(L[arr[i].r], arr[i].l);
    memset(state, 0, sizeof state);
    for (int i = 1, r = 0; i <= n; i++) {
      r = max(r, tag[i]);
      state[i] = (r >= i ? 1 : 0);
    }
    memset(dp, 0, sizeof dp);
    dp[0] = 1;
    int now = 1, l = 0;
    for (int i = 1; i <= n; i++) {
      if (state[i] == 0) dp[i] = (((long long)now) % 998244353);
      for (; l < L[i]; l++)
        now = (((long long)now - dp[l] + 998244353) % 998244353);
      now = (((long long)now + dp[i]) % 998244353);
    }
    ans = (((long long)ans * now) % 998244353);
  }
  cout << ans << endl;
  return 0;
}
