#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> p_ll;

template<class T>
void debug(T itr1, T itr2) { auto now = itr1; while(now<itr2) { cout << *now << " "; now++; } cout << endl; }
#define repr(i,from,to) for (ll i=(ll)from; i<(ll)to; i++)
#define all(vec) vec.begin(), vec.end()
#define rep(i,N) repr(i,0,N)
#define per(i,N) for (ll i=(ll)N-1; i>=0; i--)
#define popcount __builtin_popcount

const ll LLINF = pow(2,61)-1;
const ll INF = pow(2,30)-1;

ll gcd(ll a, ll b) { if (a<b) swap(a,b); return b==0 ? a : gcd(b, a%b); }
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }

int main() {
  ll N, M; cin >> N >> M;
  ll x[M], y[M], z[M]; rep(i,M) { cin >> x[i] >> y[i] >> z[i]; x[i]--; y[i]--; }

  ll result = 0;
  if (N<=4) {
    rep(bit,1<<(N*N)) {
      ll now[N][N]; rep(j,N*N) now[j%N][j/N] = bit>>j&1;
      bool ok = true; rep(i,M) ok &= now[x[i]][y[i]]==z[i];
      if (!ok) continue;
      repr(d,2,N+1) rep(t,N-d+1) rep(l,N-d+1) {
        ll sum = 0; rep(i,d) rep(j,d) sum += now[t+i][l+j];
        ok &= sum%2==d%2;
      }
      result += ok;
      // if (ok) {
      //   cout << bit << endl;
      //   rep(i,N) debug(now[i],now[i]+N);
      // }
    }
  }
  else if (N==5) {
    ll r[8][5][5] = {
      {
        {1,1,1,1,1},
        {1,1,1,1,1},
        {1,1,1,1,1},
        {1,1,1,1,1},
        {1,1,1,1,1}
      },
      {
        {1,1,0,1,1},
        {1,1,0,1,1},
        {0,0,1,0,0},
        {1,1,0,1,1},
        {1,1,0,1,1}
      },
      {
        {0,0,0,0,0},
        {0,0,0,0,0},
        {1,1,1,1,1},
        {0,0,0,0,0},
        {0,0,0,0,0}
      },
      {
        {0,0,1,0,0},
        {0,0,1,0,0},
        {0,0,1,0,0},
        {0,0,1,0,0},
        {0,0,1,0,0}
      },
      {
        {1,0,1,1,0},
        {0,1,0,0,1},
        {1,0,1,1,0},
        {1,0,1,1,0},
        {0,1,0,0,1}
      },
      {
        {1,0,0,1,0},
        {0,1,1,0,1},
        {0,1,1,0,1},
        {1,0,0,1,0},
        {0,1,1,0,1}
      },
      {
        {0,1,1,0,1},
        {1,0,0,1,0},
        {0,1,1,0,1},
        {0,1,1,0,1},
        {1,0,0,1,0}
      },
      {
        {0,1,0,0,1},
        {1,0,1,1,0},
        {1,0,1,1,0},
        {0,1,0,0,1},
        {1,0,1,1,0}
      }
    };
    rep(i,8) {
      bool ok = true;
      rep(j,M) ok &= r[i][x[j]][y[j]]==z[j];
      result += ok;
    }
  }
  else if (N==6) {
    ll r[2][6][6] = {
      {
        {1,1,1,1,1,1},
        {1,1,1,1,1,1},
        {1,1,1,1,1,1},
        {1,1,1,1,1,1},
        {1,1,1,1,1,1},
        {1,1,1,1,1,1}
      },
      {
        {1,0,1,1,0,1},
        {0,1,0,0,1,0},
        {1,0,1,1,0,1},
        {1,0,1,1,0,1},
        {0,1,0,0,1,0},
        {1,0,1,1,0,1}
      }
    };
    rep(i,2) {
      bool ok = true;
      rep(j,M) ok &= r[i][x[j]][y[j]]==z[j];
      result += ok;
    }
  }
  else {
    result = 1;
    rep(i,M) result &= z[i];
  }
  cout << result << endl;
  return 0;
}