#include <bits/stdc++.h>
using namespace std;
int f[500010], d[500010], ans = 1, n, m, mp[500010], k;
vector<pair<int, int> > lim[500010];
int calc(int x) {
  for (int i = 1; i <= n; i++) f[i] = d[i] = 0;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j < (int)lim[i].size(); j++)
      if ((lim[i][j].second >> x) & 1) d[lim[i][j].first]++, d[i + 1]--;
  for (int i = 1; i <= n; i++) d[i] += d[i - 1];
  int sum = 1, sum2 = 0, tot = 0, cur = 0;
  f[0] = 1;
  for (int i = 1; i <= n; i++) {
    if (!d[i])
      mp[i] = ++tot;
    else
      mp[i] = tot;
    if (!d[i])
      f[tot] = (sum - sum2 + 998244353) % 998244353,
      (sum += f[tot]) %= 998244353;
    for (int j = 0; j < (int)lim[i].size(); j++)
      if (!((lim[i][j].second >> x) & 1)) {
        if (d[i] && d[lim[i][j].first] && mp[i] == mp[lim[i][j].first])
          return 0;
        int tmp =
            d[lim[i][j].first] ? mp[lim[i][j].first] + 1 : mp[lim[i][j].first];
        while (cur < tmp) (sum2 += f[cur]) %= 998244353, cur++;
      }
  }
  int ans = 0;
  for (int i = cur; i <= tot; i++) (ans += f[i]) %= 998244353;
  return ans;
}
int main() {
  scanf("%d%d%d", &n, &k, &m);
  for (int i = 1, x, y, z; i <= m; i++)
    scanf("%d%d%d", &x, &y, &z), lim[y].push_back(make_pair(x, z));
  for (int i = 0; i < k; i++) ans = 1ll * ans * calc(i) % 998244353;
  printf("%d\n", ans);
}
