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

int main() {
    int N,M;
    cin >> N >> M;
    if(N >= 6) {
        cout << 0 << endl;
        return 0;
    }
    vector<int>x(M),y(M),z(M);
    for(int i = 0; i < M; i++) {
        cin >> x[i] >> y[i] >> z[i];
        x[i]--;
        y[i]--;
    }
    if(N == 5) {
        int ans = 1;
        for(int i = 0; i < M; i++) {
            if(x[i] == 2 && z[i] == 0) {
                ans = 0;
            }
            if(x[i] != 2 && z[i] == 1) {
                ans = 0;
            }
        }
        int ans2 = 1;
        for(int i = 0; i < M; i++) {
            if(y[i] == 2 && z[i] == 0) {
                ans2 = 0;
            }
            if(y[i] != 2 && z[i] == 1) {
                ans2 = 0;
            }
        }
        cout << ans+ans2 << endl;
        return 0;
    }
    int ans = 0;
    for(int i = 0; i < (1 << N*N); i++) {
        vector<vector<int>>cnt(N,vector<int>(N));
        for(int j = 0; j < N*N; j++) {
            cnt[j/N][j%N] = 1 & (i >> j);
        }
        bool flag = true;
        for(int j = 0; j < M; j++) {
            if(cnt[x[j]][y[j]] != z[j]) {
                flag = false;
            }
        }
        for(int t = 1; t <= 3; t++) {
            for(int j = 0; j < N-t; j++) {
                for(int k = 0; k < N-t; k++) {
                    int res = 0;
                    for(int l = 0; l <= t; l++) {
                        for(int m = 0; m <= t; m++) {
                            res += cnt[j+l][k+m];
                        }
                    }
                    if(res%2 == t%2) {
                        flag = false;
                    }
                }
            }
        }
        if(flag) {
            ans++;
        }
    }
    cout << ans << endl;
}