func_code_string: #include <bits/stdc++.h>   using namespace std;   const long long mod = 998244353;   int n, m, k;   int p[40];   struct query {     int l, r, x;   };   struct query q[500005];   int max0[500005], max1[500005];   long long dp[500005];   long long s[500005];   void solve() {     cin >> n >> k >> m;     p[0] = 1;     for (int i = 1; i < 40; i++) p[i] = (p[i - 1] << 1);     n++;     for (int(i) = (1); (i) <= (m); ++(i)) cin >> q[i].l >> q[i].r >> q[i].x;     m++;     q[m].l = n;     q[m].r = n;     q[m].x = 0;     long long ans = 1;     for (int(j) = (0); (j) <= (k - 1); ++(j)) {       for (int(i) = (0); (i) <= (n); ++(i)) {         max0[i] = max1[i] = -1;       }       for (int(i) = (1); (i) <= (m); ++(i)) {         if (q[i].x & p[j]) {           if (max1[q[i].l] < q[i].r) max1[q[i].l] = q[i].r;         } else {           if (max0[q[i].r] < q[i].l) max0[q[i].r] = q[i].l;         }       }       for (int i = 0; i <= n; i++) s[i] = 0;       int L0 = 0;       int R1 = -1;       dp[0] = 1;       s[0] = 1;       for (int i = 1; i <= n; i++) {         R1 = max(R1, max1[i]);         if (i <= R1) {           dp[i] = 0;         } else {           dp[i] = (L0 == 0 ? s[i - 1] : s[i - 1] - s[L0 - 1]);           dp[i] %= mod;         }         s[i] = (s[i - 1] + dp[i]) % mod;         L0 = max(L0, max0[i]);       }       ans = (ans * dp[n]) % mod;     }     if (ans < 0) ans += mod;     cout << (ans) <<   n ;   }   int main() {     ios_base::sync_with_stdio(0);     cin.tie(0);     cout.tie(0);     int T = 1;     for (int t = 1; t <= T; t++) solve();   }   