#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; using graph = vector > ; using P= pair; using vi=vector; using vvi=vector; using vll=vector; using vvll=vector; using vp=vector

; using vvp=vector; using vd=vector; using vvd =vector; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout < bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } // https://youtu.be/L8grWxBlIZ4?t=9858 // https://youtu.be/ERZuLAxZffQ?t=4807 : optimize // https://youtu.be/8uowVvQ_-Mo?t=1329 : division //ll mod =998244353; ll mod =1e9+7; struct mint { ll x; // typedef long long ll; mint(ll x=0):x((x%mod+mod)%mod){} mint operator-() const { return mint(-x);} mint& operator+=(const mint a) { if ((x += a.x) >= mod) x -= mod; return *this; } mint& operator-=(const mint a) { if ((x += mod-a.x) >= mod) x -= mod; return *this; } mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;} mint operator+(const mint a) const { return mint(*this) += a;} mint operator-(const mint a) const { return mint(*this) -= a;} mint operator*(const mint a) const { return mint(*this) *= a;} mint pow(ll t) const { if (!t) return 1; mint a = pow(t>>1); a *= a; if (t&1) a *= *this; return a; } // for prime mod mint inv() const { return pow(mod-2);} mint& operator/=(const mint a) { return *this *= a.inv();} mint operator/(const mint a) const { return mint(*this) /= a;} }; istream& operator>>(istream& is, const mint& a) { return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) { return os << a.x;} // combination mod prime // https://www.youtube.com/watch?v=8uowVvQ_-Mo&feature=youtu.be&t=1619 struct combination { vector fact, ifact; combination(int n):fact(n+1),ifact(n+1) { //assert(n < mod); fact[0] = 1; for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i; ifact[n] = fact[n].inv(); for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i; } mint operator()(int n, int k) { if (k < 0 || k > n) return 0; if (n<0) return 0; return fact[n]*ifact[k]*ifact[n-k]; } mint p(int n, int k) { return fact[n]*ifact[n-k]; } } c(2000000); using vm=vector ; using vvm=vector ; struct edge{ int to; ll cost; edge(int to,ll cost) : to(to),cost(cost){} }; using ve=vector; using vve=vector; struct Compress{ vll a; map d,d2; int cnt; Compress() :cnt(0) {} void add(ll x){a.push_back(x);} void init(){ sets(a.begin(),a.end()); for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; for(auto u:d)d2[u.second]=u.first; } ll to(ll x){return d[x];} //変換先 ll from(ll x){return d2[x];}//逆引き int size(){return cnt;} }; //vll anss; using S=mint; using F = mint; S op(S a, S b){ return a+b; } S e(){ return 0; } S mapping(F f, S x){ return x*f; } F composition(F f, F g){ return f*g; } F id(){ return 1; } void solve(int test){ int n,m; cin >> n >> m; vi l(m),r(m),p(m); rep(i,m)cin >> l[i] >> r[i] >> p[i]; vi sum(n+1); vi g(n+1,-1); rep(i,m){ if(p[i]!=0){ sum[l[i]]++; if(r[i]+1<=n)sum[r[i]+1]--; } else g[r[i]]=i; } for(int i=1; i<=n; i++)sum[i]+=sum[i-1]; vector dp(n+1); dp[0]=1; lazy_segtree seg(dp); int maxl=0; for(int i=1; i<=n; i++){ int id=g[i]; if(id!=-1){ if(sum[i]==0){ mint now=seg.prod(maxl,i); seg.apply(0,n+1,2); seg.set(i,now); } chmax(maxl,l[id]); } else { if(sum[i]==0){ mint now=seg.prod(maxl,i); seg.apply(0,n+1,2); seg.set(i,now); } } } mint ans=seg.prod(maxl,n+1); int cnt=0; for(int i=1; i<=n; i++)cnt+=(sum[i]>0); rep(i,m)if(p[i]!=0)cnt--; ans*=pow_pow(2,cnt,mod); cout << ans << endl; } //g++ main.cpp -std=c++17 -I . int main(){cin.tie(0);ios::sync_with_stdio(false); int t=1;//cin >> t; rep(test,t)solve(test); // for(auto u:anss)putsYes(u); }