func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename T1, typename T2>   istream &operator>>(istream &in, pair<T1, T2> &a) {     in >> a.first >> a.second;     return in;   }   template <typename T1, typename T2>   ostream &operator<<(ostream &out, pair<T1, T2> a) {     out << a.first <<     << a.second;     return out;   }   template <typename T, typename T1>   T amax(T &a, T1 b) {     if (b > a) a = b;     return a;   }   template <typename T, typename T1>   T amin(T &a, T1 b) {     if (b < a) a = b;     return a;   }   const long long INF = 1e18;   const int32_t M = 1e9 + 7;   const int32_t MM = 998244353;   const int N = 5e5 + 5;   const int32_t MOD = MM;   struct mod_int {     int32_t val;     mod_int(long long v = 0) {       if (v < 0) v = v % MOD + MOD;       if (v >= MOD) v %= MOD;       val = v;     }     static int32_t mod_inv(int32_t a, int32_t m = MOD) {       int32_t g = m, r = a, x = 0, y = 1;       while (r != 0) {         int32_t q = g / r;         g %= r;         swap(g, r);         x -= q * y;         swap(x, y);       }       return x < 0 ? x + m : x;     }     static unsigned fast_mod(uint64_t x, unsigned m = MOD) {       return x % m;       unsigned x_high = x >> 32, x_low = (unsigned)x;       unsigned quot, rem;       asm( divl %4 n  :  =a (quot),  =d (rem) :  d (x_high),  a (x_low),  r (m));       return rem;     }     explicit operator int() const { return val; }     mod_int &operator+=(const mod_int &other) {       val += other.val;       if (val >= MOD) val -= MOD;       return *this;     }     mod_int &operator-=(const mod_int &other) {       val -= other.val;       if (val < 0) val += MOD;       return *this;     }     mod_int &operator*=(const mod_int &other) {       val = fast_mod((uint64_t)val * other.val);       return *this;     }     mod_int &operator/=(const mod_int &other) { return *this *= other.inv(); }     friend mod_int operator+(const mod_int &a, const mod_int &b) {       return mod_int(a) += b;     }     friend mod_int operator-(const mod_int &a, const mod_int &b) {       return mod_int(a) -= b;     }     friend mod_int operator*(const mod_int &a, const mod_int &b) {       return mod_int(a) *= b;     }     friend mod_int operator/(const mod_int &a, const mod_int &b) {       return mod_int(a) /= b;     }     mod_int &operator++() {       val = val == MOD - 1 ? 0 : val + 1;       return *this;     }     mod_int &operator--() {       val = val == 0 ? MOD - 1 : val - 1;       return *this;     }     mod_int operator++(int32_t) {       mod_int before = *this;       ++*this;       return before;     }     mod_int operator--(int32_t) {       mod_int before = *this;       --*this;       return before;     }     mod_int operator-() const { return val == 0 ? 0 : MOD - val; }     bool operator==(const mod_int &other) const { return val == other.val; }     bool operator!=(const mod_int &other) const { return val != other.val; }     mod_int inv() const { return mod_inv(val); }     friend ostream &operator<<(ostream &stream, const mod_int &m) {       return stream << m.val;     }     friend istream &operator>>(istream &stream, mod_int &m) {       return stream >> m.val;     }     mod_int pow(long long p) const {       assert(p >= 0);       mod_int a = *this, result = 1;       while (p > 0) {         if (p & 1) result *= a;         a *= a;         p >>= 1;       }       return result;     }   };   int n, k, m;   pair<pair<int, int>, int> x[N];   vector<int> v[N];   bool is1[N][32];   int cnt[32];   int last[32];   int f[N][32];   mod_int dp[N][32];   mod_int ps[N][32];   void solve() {     cin >> n >> k >> m;     for (int i = 1; i < m + 1; i++) {       cin >> x[i];     }     sort(x + 1, x + m + 1);     for (int i = 1; i < m + 1; i++) {       v[x[i].first.first].push_back(i);       v[x[i].first.second].push_back(-i);     }     for (int i = 1; i < n + 2; i++) {       for (int y : v[i]) {         if (y < 0) {         } else {           for (int j = 0; j < k; j++) {             if (((x[y].second >> j) & 1)) cnt[j]++;           }         }       }       for (int j = 0; j < k; j++) {         if (cnt[j]) is1[i][j] = 1;       }       for (int j = 0; j < k; j++) {         f[i][j] = last[j];       }       for (int y : v[i]) {         if (y < 0) {           y *= -1;           for (int j = 0; j < k; j++) {             if (((x[y].second >> j) & 1))               cnt[j]--;             else               amax(last[j], x[y].first.first);           }         }       }     }     for (int j = 0; j < k; j++) {       dp[0][j] = 1;       ps[0][j] = 1;     }     for (int i = 1; i < n + 2; i++) {       for (int j = 0; j < k; j++) {         if (!is1[i][j]) {           dp[i][j] = ps[i - 1][j];           if (f[i][j]) dp[i][j] -= ps[f[i][j] - 1][j];         }         ps[i][j] = dp[i][j] + ps[i - 1][j];       }     }     mod_int ans = 1;     for (int i = 0; i < k; i++) {       ans *= dp[n + 1][i];     }     cout << ans;   }   signed main() {     ios_base::sync_with_stdio(false);     cin.tie(0);     cout.tie(0);     int t = 1;     while (t--) solve();     return 0;   }   