#include<bits/stdc++.h>
typedef long long ll;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;
const ll mod = 998244353;
ll f[1 << 24];
bool g[25][25][25];
bool fg[25][25];
int cnt = 0;
pii arr[10100];
int np[25][25];
void solve() {
    int n, m;
    std::cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int a, b, c;
        std::cin >> a >> b >> c;
        g[a][b][c] = true;
        g[c][b][a] = true;
    }
    for (int a = 1; a <= n; a++) {
        for (int b = 1; b <= n; b++) {
            for (int c = 1; c <= n; c++) {
                if (g[c][a][b] or g[c][b][a]) {
                    np[a][b] |= (1 << (c - 1));
                }
            }
        }
    }
    f[0] = 1;
    for (int p = 0; p < (1 << n); p++) {
        int x = 0;
        for (int a = 1; a <= n; a++) {
            if(!(p & (1 << (a - 1))))
                continue;
            for (int b = 1; b <= n; b++) {
                if ((!(p & (1 << (b - 1))))) {
                    x |= np[a][b];
                }
            }
        }
        for (int c = 1; c <= n; c++) {
            if (p & (1 << (c - 1)))
                continue;
            if (!(x & (1 << (c - 1)))) {
                f[p | (1 << (c - 1))] = (f[p | (1 << (c - 1))] + f[p]) % mod;
            }
        }
    }
    std::cout << f[(1 << n) - 1] << "\n";
}
int main() {
    std::ios::sync_with_stdio(0);
    std::cin.tie(0), std::cout.tie(0);
    int t = 1;
    while (t--)solve();
    return 0;
}