#include <iostream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <limits>
#include <algorithm>
#include <array>
#include <vector>
#include <deque>
#include <queue>
#include <list>
#include <stack>
#include <string>
#include <functional>
#include <numeric>
#include <map>
#include <set>
#include <cstdlib>
#include <bitset>
#include <unordered_map>
#include <random>
#include <cmath>
#include <complex>
// #include "utiltime.hpp"

using namespace std;

typedef long long int ll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef pair<int, int> P;
typedef pair<ll, ll> Pll;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef complex<double> cdouble;

const int INFL = (int)1e9;
const ll INFLL = (ll)1e18;
const double INFD = numeric_limits<double>::infinity();
const double PI = 3.14159265358979323846;
#define Loop(i, n) for(int i = 0; i < (int)n; i++)
#define Loopll(i, n) for(ll i = 0; i < (ll)n; i++)
#define Loop1(i, n) for(int i = 1; i <= (int)n; i++)
#define Loopll1(i, n) for(ll i = 1; i <= (ll)n; i++)
#define Loopr(i, n) for(int i = (int)n - 1; i >= 0; i--)
#define Looprll(i, n) for(ll i = (ll)n - 1; i >= 0; i--)
#define Loopr1(i, n) for(int i = (int)n; i >= 1; i--)
#define Looprll1(i, n) for(ll i = (ll)n; i >= 1; i--)
#define Foreach(buf, container) for(auto buf : container)
#define Loopdiag(i, j, h, w, sum) for(int i = ((sum) >= h ? h - 1 : (sum)), j = (sum) - i; i >= 0 && j < w; i--, j++)
#define Loopdiagr(i, j, h, w, sum) for(int j = ((sum) >= w ? w - 1 : (sum)), i = (sum) - j; j >= 0 && i < h; j--, i++)
#define Loopdiagsym(i, j, h, w, gap) for (int i = ((gap) >= 0 ? (gap) : 0), j = i - (gap); i < (h) && j < (w); i++, j++)
#define Loopdiagsymr(i, j, h, w, gap) for (int i = ((gap) > (h) - (w) - 1 ? (h) - 1 : (w) - 1 + (gap)), j = i - (gap); i >= 0 && j >= 0; i--, j--)
#define Loopitr(itr, container) for(auto itr = container.begin(); itr != container.end(); itr++)
#define printv(vector) Loop(extra_i, vector.size()) { cout << vector[extra_i] << " "; } cout << endl;
#define printmx(matrix) Loop(extra_i, matrix.size()) { Loop(extra_j, matrix[extra_i].size()) { cout << matrix[extra_i][extra_j] << " "; } cout << endl; }
#define quickio() ios::sync_with_stdio(false); cin.tie(0);
#define readfile(filename) ifstream in(filename); cin.rdbuf(in.rdbuf());
#define bitmanip(m,val) static_cast<bitset<(int)m>>(val)
bool nearlyeq(double x, double y) { return abs(x - y) < 1e-9; }
bool inrange(int x, int t) { return x >= 0 && x < t; }
ll rndf(double x) { return (ll)(x + (x >= 0 ? 0.5 : -0.5)); }
ll floorsqrt(double x) { ll m = (ll)sqrt(x); return m + (m * m <= (ll)(x) ? 0 : -1); }
ll ceilsqrt(double x) { ll m = (ll)sqrt(x); return m + ((ll)x <= m * m ? 0 : 1); }
ll rnddiv(ll a, ll b) { return (a / b + (a % b * 2 >= b ? 1 : 0)); }
ll ceildiv(ll a, ll b) { return (a / b + (a % b == 0 ? 0 : 1)); }
ll gcd(ll m, ll n) { if (n == 0) return m; else return gcd(n, m % n); }

/*******************************************************/

namespace mod_op {

	const ll MOD = 998244353;

		class modll {
		private:
			ll val;
			inline ll modify(ll x) { ll ret = x % MOD; if (ret < 0) ret += MOD; return ret; }
			inline ll inv(ll x) {
				if (x == 0) return 1 / x;
				else if (x == 1) return 1;
				else return modify(inv(MOD % x) * modify(-MOD / x));
			}
		public:
			modll(ll init = 0) { val = modify(init); return; }
			modll(const modll& another) { val = another.val; return; }
			inline modll& operator=(const modll &another) { val = another.val; return *this; }
			inline modll operator+(const modll &x) { return modify(val + x.val); }
			inline modll operator-(const modll &x) { return modify(val - x.val); }
			inline modll operator*(const modll &x) { return modify(val * x.val); }
			inline modll operator/(const modll &x) { return modify(val * inv(x.val)); }
			inline modll& operator+=(const modll &x) { val = modify(val + x.val); return *this; }
			inline modll& operator-=(const modll &x) { val = modify(val - x.val); return *this; }
			inline modll& operator*=(const modll &x) { val = modify(val * x.val); return *this; }
			inline modll& operator/=(const modll &x) { val = modify(val * inv(x.val)); return *this; }
			inline bool operator==(const modll &x) { return val == x.val; }
			inline bool operator!=(const modll &x) { return val != x.val; }
			friend inline istream& operator >> (istream &is, modll& x) { is >> x.val; return is; }
			friend inline ostream& operator << (ostream &os, const modll& x) { os << x.val; return os; }
			ll get_val() { return val; }
	};

	modll pow(modll n, ll p) {
		modll ret;
		if (p == 0) ret = 1;
		else if (p == 1) ret = n;
		else {
			ret = pow(n, p / 2);
			ret *= ret;
			if (p % 2 == 1) ret *= n;
		}
		return ret;
	}
}

using namespace mod_op;
typedef vector<modll> vmodll;
typedef vector<vector<modll>> vvmodll;

vvi cnt_fixed(int p, const vector<P> hs, const vector<P> vs) {
	vvi ret(2, vi(2, 0));
	Loop(x, 2) {
		Loop(y, 2) {
			int i = 0, j = 0;
			while (i < hs.size() || j < vs.size()) {
				if (i < hs.size() && j < vs.size()) {
					if (hs[i].first == vs[j].first) {
						if (hs[i].first == p - 1 && (hs[i].second + vs[j].second + x + y) % 2 == 1) {
							ret[x][y] = INT_MAX;
							break;
						}
						else if (hs[i].first == p - 2 && (hs[i].second + vs[j].second + x) % 2 == 1) {
							ret[x][y] = INT_MAX;
							break;
						}
						else if (hs[i].first <= p - 3 && (hs[i].second + vs[j].second) % 2 == 1) {
							ret[x][y] = INT_MAX;
							break;
						}
						else ret[x][y] += 1;
						i++; j++;
					}
					else if (hs[i].first < vs[j].first) {
						ret[x][y] += 1;
						i++;
					}
					else if (hs[i].first > vs[j].first) {
						ret[x][y] += 1;
						j++;
					}
				}
				else if (i < hs.size()) {
					ret[x][y] += 1;
					i++;
				}
				else if (j < vs.size()) {
					ret[x][y] += 1;
					j++;
				}
			}
		}
	}
	return ret;
}

int main() {
	int n, m; cin >> n >> m;
	vector<vector<P>> hs(n), vs(n);
	vector<int> x(n, -1);
	Loop(i, m) {
		int a, b, c; cin >> a >> b >> c; a--; b--;
		if (a == b) x[a] = c;
		else if (a > b) hs[a].push_back({ b, c });
		else if (a < b) vs[b].push_back({ a, c });
	}
	Loop(i, n) sort(hs[i].begin(), hs[i].end());
	Loop(i, n) sort(vs[i].begin(), vs[i].end());
	vvmodll dp(n, vmodll(2, 0));
	if (x[0] != 1) dp[0][0] = 1;
	if (x[0] != 0) dp[0][1] = 1;
	Loop1(i, n - 1) {
		vvi vals = cnt_fixed(i, hs[i], vs[i]);
		if (x[i] != 1) {
			if (vals[0][0] != INT_MAX) dp[i][0] += dp[i - 1][0] * pow(modll(2), i - vals[0][0]);
			if (vals[1][0] != INT_MAX) dp[i][0] += dp[i - 1][1] * pow(modll(2), i - vals[1][0]);
		}
		if (x[i] != 0) {
			if (vals[0][1] != INT_MAX) dp[i][1] += dp[i - 1][0] * pow(modll(2), i - vals[0][1]);
			if (vals[1][1] != INT_MAX) dp[i][1] += dp[i - 1][1] * pow(modll(2), i - vals[1][1]);
		}
	}
	cout << dp[n - 1][0] + dp[n - 1][1] << endl;
}

Measured memory_bytes: 12416