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

const ll mod= 998244353;
const int MX=(1<<24)+10;

int n,m,com[MX],val[27][27];
ll dp[MX];
bool can[MX][25];

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

    for (int k=0; k<n; ++k) {
        can[0][k]=true;
        for (int bit=1; bit<(1<<n); ++bit) {
            int x=bit&-bit,lft=bit-x;
            if (can[lft][k] && ((val[com[x]][k]&lft)==0)) can[bit][k]=true;
        }
    }

    dp[0]=1;
    for (int bit=1; bit<(1<<n); ++bit) {
        for (int k=0; k<n; ++k) if (bit&(1<<k)) {
            if (can[bit^(1<<k)][k] && can[bit^((1<<n)-1)][k]) dp[bit]=(dp[bit]+dp[bit^(1<<k)])%mod;
        }
    }
    cout<<dp[(1<<n)-1]<<"\n";
}