#include <bits/stdc++.h>

using namespace std;

const int O = 1e7 + 5;
const int N = (1 << 20) + 5;
const int mod = 998244353;
const int inf = 1e9;
int pr[] = {167772161, 469762049, 754974721, 1045430273, 1051721729, 1053818881};

int n, m, d[30][30], f[O], dd[O], rdd[O];
vector <int> layer[30];

void Add(int &x, int y){
    x += y;
    if (x >= mod) x -= mod;
    if (x < 0) x += mod;
}

main(){
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m;

    int all = (1 << n) - 1;

    for (int i = 1; i <= m; ++ i){
        int a, b, c; cin >> a >> b >> c;
        a -= 1; b -= 1; c -= 1;
        dd[(1 << a) | (1 << c)] |= 1 << b;
        rdd[all ^ ((1 << a) | (1 << c))] |= 1 << b;
    }

    for (int i = 0; i < 1 << n; ++ i) layer[__builtin_popcount(i)].push_back(i);

    for (int j = 0; j < n; ++ j){
        for (int i = 0; i < 1 << n; ++ i){
            if (i >> j & 1) dd[i] |= dd[i ^ (1 << j)];
        }
    }

    for (int j = 0; j < n; ++ j){
        for (int i = (1 << n) - 1; i >= 0; -- i){
            if (!(i >> j & 1)) rdd[i] |= rdd[i ^ (1 << j)];
        }
    }

    //cout << endl;

    f[0] = 1;
    for (int i = 0; i < 30; ++ i){
        for (int z : layer[i]){
            for (int j = 0; j < n; ++ j){
                if (!(z >> j & 1) && !(dd[z] >> j & 1) && !(rdd[z] >> j & 1)) Add(f[z | (1 << j)], f[z]);
            }
            //if (i == 1 || i == 2) cout << i << " " << z << " " << f[z] << endl;
        }
    }

    //cout << dd[11] << endl;
    //cout << f[17] << endl;

    cout << f[all];
}
/**
5 4
1 2 4
2 3 5
3 2 4
1 3 2

4 2
3 1 4
1 4 3
**/