#include <bits/stdc++.h>
using namespace std;

const int maxn = 24, maxm = maxn * maxn * maxn, mod = 998244353;
int n, m;
int a[maxm], b[maxm], c[maxm];
set<vector<int>> st;
// bitset<1<<maxn> invalid[maxn][maxn]; // invalid[a][b][mask] = boleh ga dari a ke b kalo masknya mask?
// set<int> invalid[maxn][maxn];
bool invalid[1<<maxn][maxn];
int dp[1<<maxn][maxn];
int ans;

int cut(int mask, int l, int r) {
	return (mask >> l) & ~(1 << (r-l+1));
}

int main() {
	ios_base::sync_with_stdio(0); cin.tie(0);
	cin >> n >> m;
	for (int i=0; i<m; i++) {
		cin >> a[i] >> b[i] >> c[i];
		a[i]--, b[i]--, c[i]--;
	}

	for (int i=0; i<m; i++) {
		vector<int> abc = {a[i], b[i], c[i]};
		sort(abc.begin(), abc.end());
		if (st.count(abc)) {
			cout << "0\n";
			return 0;
		}
		st.insert(abc);
	}

	memset(invalid, false, sizeof invalid);
	for (int i=0; i<m; i++) {

		// gaboleh ke b kalo a dan c sama
		vector<int> srt = {a[i], b[i], c[i]};
		sort(srt.begin(), srt.end());
		for (int mask=0; mask<(1<<(n-3)); mask++) {
			int true_mask = 0;

			if (srt[0] > 0) true_mask |= cut(mask, 0, srt[0] - 1);
			if (srt[0] + 1 <= srt[1] - 1) true_mask |= (cut(mask, srt[0], srt[1] - 2) << (srt[0] + 1));
			if (srt[1] + 1 <= srt[2] - 1) true_mask |= (cut(mask, srt[1] - 1, srt[2] - 3) << (srt[1] + 1));
			if (srt[2] + 1 <= n-1) true_mask |= (cut(mask, srt[2] - 2, n - 4) << (srt[2] + 1));
			invalid[true_mask][b[i]] = true;

			true_mask |= (1 << a[i]);
			true_mask |= (1 << c[i]);
			invalid[true_mask][b[i]] = true;
		}
	}

	memset(dp, 0, sizeof dp);
	for (int mask=1; mask<(1<<n); mask++) {
		if ((mask&(mask-1)) == 0) {
			int i = 31 - __builtin_clz(mask);
			dp[mask][i] = (!invalid[0][i]); // cek dulu i pernah jadi b atau nggak
		} else {
			vector<int> ons;
			for (int i=0; i<n; i++) {
				if ((mask >> i) & 1) ons.push_back(i);
			}
			for (int i : ons) {
				for (int j : ons) {
					if (i == j) continue;
					int pre_mask = mask & ~(1 << j);
					// if (!invalid[i][j][pre_mask]) dp[mask][j] = (dp[mask][j] + dp[pre_mask][i]) % mod;
					// if (!invalid[i][j].count(pre_mask)) dp[mask][j] = (dp[mask][j] + dp[pre_mask][i]) % mod;
					if (!invalid[pre_mask][j]) dp[mask][j] = (dp[mask][j] + dp[pre_mask][i]) % mod;;
				}
			}
		}
	}

	ans = 0;
	for (int i=0; i<n; i++) ans = (ans + dp[(1 << n) - 1][i]) % mod;
	cout << ans << '\n';
}