#include <iostream>

struct ios_do_not_sync{
    ios_do_not_sync(){
        std::ios::sync_with_stdio(false);
        std::cin.tie(nullptr);
    }
} ios_do_not_sync_instance;


#include <vector>
#include <cassert>
#include <atcoder/modint>


template<class Elem, atcoder::internal::is_static_modint_t<Elem>* = nullptr>
struct modulo_matrix{
private:
    using m32 = Elem;
public:
    int h;
    int w;
    std::vector<m32> elems;
    
    modulo_matrix(int new_h, int new_w){ h = new_h; w = new_w; elems.assign(h * w, 0); }
    modulo_matrix(const modulo_matrix&) = default;
    typename std::vector<m32>::iterator operator[](int y){ return elems.begin() + (y * w); }
    typename std::vector<m32>::const_iterator operator[](int y) const { return elems.begin() + (y * w); }
    static modulo_matrix identity(int idx){ auto res = modulo_matrix(idx, idx); for(int i = 0; i < idx; i++) res[i][i] = 1; return res; }
    modulo_matrix operator*(const modulo_matrix& r) const {
        assert(w == r.h);
        auto res = modulo_matrix(h, r.w);
        for (int i=0; i<h; i++) for (int j=0; j<w; j++) for (int k=0; k<r.w; k++) res[i][k] += (*this)[i][j] * r[j][k];
        return res;
    }
    m32 det() const {
        assert(h == w);
        modulo_matrix g = *this;
        m32 ans = 1;
        for (int i=0; i<h; i++) {
            int tg = -1;
            for (int j=i; j<h; j++) { if (g[j][i] != 0) tg = j; }
            if (tg == -1) return 0;
            if (tg != i) ans = -ans;
            for (int j=0; j<h; j++) std::swap(g[i][j], g[tg][j]); tg = i;
            ans *= g[i][i];
            m32 const_coeff = g[i][i].inv();
            for (int j=0; j<h; j++) g[i][j] *= const_coeff;
            for (int j=i+1; j<h; j++) for(int k=h-1; k>=i; k--) g[j][k] -= g[j][i] * g[i][k];
        }
        return ans;
    }
    int rank() const {
        modulo_matrix g = *this;
        int y = 0;
        for (int i=0; i<w; i++) {
            if(y == h) break;
            int tg = -1;
            for (int j=y; j<h; j++) { if (g[j][i] != 0){ tg = j; break; } }
            if (tg == -1) continue;
            for (int j=i; j<w; j++) std::swap(g[y][j], g[tg][j]); tg = y;
            m32 const_coeff = g[y][i].inv();
            for (int j=i; j<w; j++) g[y][j] *= const_coeff;
            for (int j=y+1; j<w; j++) for(int k=w-1; k>y; k--) g[j][k] -= g[j][i] * g[y][k];
            y++;
        }
        return y;
    }
};

#include <vector>

using namespace std;

using m32 = atcoder::static_modint<998244353>;
using Matrix = modulo_matrix<m32>;

int main() {
    int N,M; cin >> N >> M;

    vector<vector<pair<int,m32>>> A(M);
    vector<vector<pair<int,m32>>> B(M);
    for(int i=0; i<M; i++){
        int u,v,w; cin >> u >> v >> w; u--; v--; w--;
        A[i].push_back(make_pair(u, m32(1)));
        A[i].push_back(make_pair(v, m32(-1)));
        B[i].push_back(make_pair(v, m32(1)));
        B[i].push_back(make_pair(w, m32(-1)));
    }

    modulo_matrix<m32> G(N,N);
    m32 rng_r = 10000;
    m32 rng = 1;
    for(int i=0; i<M; i++){
        rng *= rng_r;
        for(auto [y,vy] : A[i]) for(auto [x,vx] : B[i]) G[y][x] += rng * vy * vx;
        for(auto [y,vy] : A[i]) for(auto [x,vx] : B[i]) G[x][y] -= rng * vy * vx;
    }

    int ans = G.rank() / 2;
    cout << ans << endl;
    return 0;
}