#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto &i:a)
#define all(x) (x).begin(),(x).end()
#pragma GCC optimize ("-O3")
using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); }
typedef long long ll; const int inf = INT_MAX / 2; const ll infl = 1LL << 60;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a = b; return 1; } return 0; }
//---------------------------------------------------------------------------------------------------
template<int MOD> struct ModInt {
    static const int Mod = MOD; unsigned x; ModInt() : x(0) { }
    ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; }
    int get() const { return (int)x; }
    ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; }
    ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; }
    ModInt &operator/=(ModInt that) { return *this *= that.inverse(); }
    ModInt operator+(ModInt that) const { return ModInt(*this) += that; }
    ModInt operator-(ModInt that) const { return ModInt(*this) -= that; }
    ModInt operator*(ModInt that) const { return ModInt(*this) *= that; }
    ModInt operator/(ModInt that) const { return ModInt(*this) /= that; }
    ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0;
        while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); }
        return ModInt(u); }
    bool operator==(ModInt that) const { return x == that.x; }
    bool operator!=(ModInt that) const { return x != that.x; }
    ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; }
};
template<int MOD> ostream& operator<<(ostream& st, const ModInt<MOD> a) { st << a.get(); return st; };
template<int MOD> ModInt<MOD> operator^(ModInt<MOD> a, unsigned long long k) {
    ModInt<MOD> r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; }
template<typename T, int FAC_MAX> struct Comb { vector<T> fac, ifac;
    Comb(){fac.resize(FAC_MAX,1);ifac.resize(FAC_MAX,1);rep(i,1,FAC_MAX)fac[i]=fac[i-1]*i;
        ifac[FAC_MAX-1]=T(1)/fac[FAC_MAX-1];rrep(i,FAC_MAX-2,1)ifac[i]=ifac[i+1]*T(i+1);}
    T aPb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b]; }
    T aCb(int a, int b) { if (b < 0 || a < b) return T(0); return fac[a] * ifac[a - b] * ifac[b]; }
    T nHk(int n, int k) { if (n == 0 && k == 0) return T(1); if (n <= 0 || k < 0) return 0;
        return aCb(n + k - 1, k); }}; // nHk = (n+k-1)Ck : n is separator
typedef ModInt<998244353> mint;
/*---------------------------------------------------------------------------------------------------
　　　　　　　　　　　 ∧＿∧  
　　　　　 ∧＿∧ 　（´<_｀ ）　 Welcome to My Coding Space!
　　　　 （ ´_ゝ`）　/　 ⌒i     
　　　　／　　　＼　 　  |　|     
　　　 /　　 /￣￣￣￣/　　|  
　 ＿_(__ﾆつ/　    ＿/ .| .|＿＿＿＿  
　 　　　＼/＿＿＿＿/　（u　⊃  
---------------------------------------------------------------------------------------------------*/




int N, M;
mint dp[101010][2];
map<int, vector<int>> idx[101010];
int ex[3][3];
//---------------------------------------------------------------------------------------------------
void _main() {
    cin >> N >> M;

    rep(y, 0, 3) rep(x, 0, 3) ex[y][x] = -1;

    rep(i, 0, M) {
        int a, b, c; cin >> a >> b >> c;
        
        idx[max(a,b)][abs(a-b)].push_back(c);

        if (max(a, b) <= 2) ex[a][b] = c;
    }

    if (idx[1][0].size() == 0) dp[1][0] = dp[1][1] = 1;
    else dp[1][idx[1][0][0]] = 1;

    rep(i, 2, N + 1) rep(to, 0, 2) {
        if (idx[i][0].size() == 1 and idx[i][0][0] != to) continue;
        
        int pre = -1;

        if (i == 2) {
            if (idx[i][1].size() == 0) {
                rep(from, 0, 2) dp[i][to] += dp[i - 1][from] * 2;
            }
            else if (idx[i][1].size() == 1) {
                rep(from, 0, 2) dp[i][to] += dp[i - 1][from];
            }
            else if (idx[i][1].size() == 2) {
                rep(from, 0, 2) {
                    int xo = from ^ to ^ idx[i][1][0] ^ idx[i][1][1];
                    if (xo) continue;
                    dp[i][to] += dp[i - 1][from];
                }
            }

            pre = 1;
        }
        else {
            mint dpdp[2][2];

            if (idx[i][1].size() == 0) {
                rep(from, 0, 2) dpdp[from][to] += dp[i - 1][from] * 2;
            }
            else if (idx[i][1].size() == 1) {
                rep(from, 0, 2) dpdp[from][to] += dp[i - 1][from];
            }
            else if (idx[i][1].size() == 2) {
                rep(from, 0, 2) {
                    int xo = from ^ to ^ idx[i][1][0] ^ idx[i][1][1];
                    if (xo) continue;
                    dpdp[from][to] += dp[i - 1][from];
                }
            }

            pre = 1;

            if (idx[i][2].size() == 0) {
                rep(from, 0, 2) rep(to, 0, 2) {
                    dp[i][to] += dpdp[from][to] * 2;
                }
            }
            else if (idx[i][2].size() == 1) {
                rep(from, 0, 2) rep(to, 0, 2) {
                    dp[i][to] += dpdp[from][to];
                }
            }
            else {
                rep(from, 0, 2) rep(to, 0, 2) {
                    int xo = idx[i][2][0] ^ idx[i][2][1];

                    if (xo ^ from == 0) dp[i][to] += dpdp[from][to];
                }
            }

            pre = 2;
        }

        fore(p, idx[i]) {
            if (p.first <= pre) continue;
            int d = p.first - pre - 1;
            pre = p.first;

            dp[i][to] *= mint(2) ^ d;

            if (p.second.size() == 0) dp[i][to] *= 2;
            else if (p.second.size() == 1) {
            }
            else {
                if (p.second[0] != p.second[1]) dp[i][to] = 0;
            }
        }

        int d = i - pre - 1;
        dp[i][to] *= mint(2) ^ d;
    }

    //rep(i, 1, N + 1) rep(d, 0, 2) printf("dp[%d][%d] = %d\n", i, d, dp[i][d].get());
    
    cout << dp[N][0] + dp[N][1] << endl;
}

Measured memory_bytes: 34688