#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];
bool ada[maxn][maxn][maxn];
bool in[maxn];
int wajib1[maxn][maxn], wajib2[maxn][maxn];
int dp[1<<maxn][maxn];
int ans;

void modadd(int &a, int b) {
	a += b;
	if (a >= mod) a -= mod;
}

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]--;
	}

	memset(ada, false, sizeof ada);
	memset(in, false, sizeof in);
	for (int i=0; i<m; i++) {
		ada[a[i]][b[i]][c[i]] = true;
		ada[c[i]][b[i]][a[i]] = true;
		in[b[i]] = true;
	}
	for (int i=0; i<n; i++) {
		for (int j=i+1; j<n; j++) {
			for (int k=j+1; k<n; k++) {
				if (ada[i][j][k] && ada[i][k][j]) {
					cout << "0\n";
					return 0;
				}
			}
		}
	}

	memset(wajib1, 0, sizeof wajib1);
	memset(wajib2, 0, sizeof wajib2);
	for (int i=0; i<m; i++) {
		wajib1[a[i]][c[i]] |= (1 << b[i]);
		wajib1[c[i]][a[i]] |= (1 << b[i]);
		wajib2[b[i]][a[i]] |= (1 << c[i]);
		wajib2[b[i]][c[i]] |= (1 << a[i]);
	}

	memset(dp, 0, sizeof dp);
	for (int mask=1; mask<(1<<n); mask++) {
		if (!(mask & (mask - 1))) {
			int i = 31 - __builtin_clz(mask);
			dp[mask][i] = !in[i];
		}
		vector<int> on, off;
		for (int i=0; i<n; i++) {
			if ((mask >> i) & 1) on.push_back(i);
			else off.push_back(i);
		}
		for (int j : off) {
			int ow = 0;
			for (int i : on) ow |= wajib1[i][j];
			if ((ow & mask) != ow) continue;

			ow = 0;
			for (int i : off) ow |= wajib2[j][i];
			if ((ow & mask) != ow) continue;

			for (int i : on) {
				modadd(dp[mask | (1 << j)][j], dp[mask][i]);
			}
		}
	}

	// for (int i=0; i<n; i++) cout << dp[(1<<n)-1][i] << ' ';
	// cout << '\n';

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