#pragma GCC optimize ("Ofast")

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

#define rep(i, a, b) for (int i = int(a); i < int(b); i++)
#define trav(a, x) for (auto& a : x)
#define per(i, a, b) for (int i = int(b) - 1; i >= int(a); i--)
#define all(x) x.begin(), x.end()

template <class T> int sz(T&& a) { return int(size(forward<T>(a))); }

template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;

using ll = int64_t;
using vi = vc<int>;
using pii = pair<int, int>;
using uint = uint32_t;
using ull = uint64_t;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());

template <class F> struct ycr {
	F f;
	template <class T> explicit ycr(T&& f_) : f(forward<T>(f_)) {}

	template <class... A> decltype(auto) operator()(A&&... as) {
		return f(ref(*this), forward<A>(as)...);
	}
};
template <class F> decltype(auto) yc(F&& f) {
	return ycr<decay_t<F>>(forward<F>(f));
}

int main() {
	ios_base::sync_with_stdio(false), cin.tie(nullptr);
	cout << fixed << setprecision(20);

	int N, M;
	cin >> N >> M;
	vvc<pair<int, int>> stuff(N);
	for (int k = 0; k < M; k++) {
		int a, b, c;
		cin >> a >> b >> c;
		a--, b--, c--;
		stuff[b].emplace_back(a, c);
	}

	const uint MOD = 998244353;
	vc<uint> dp(1 << N, uint(-1));
	dp[0] = 1;
	cout << yc([&](auto self, int mask) -> uint {
		if (dp[mask] == uint(-1)) {
			ull tot = 0;
			int z = mask;
			while (z) {
				int o = z & -z;
				int b = __builtin_ctz(o);
				if ([&]() -> bool {
					for (const auto& [a, c] : stuff[b]) {
						if (((mask >> a) ^ (mask >> c)) & 1) {
							// works
						} else {
							return false;
						}
					}
					return true;
				}()) {
					tot += self(mask - o);
				}
				z -= o;
			}
			dp[mask] = uint(tot % MOD);
		}
		return dp[mask];
	})((1 << N) - 1) << '\n';

	return 0;
}