#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
// --------------------------------------------------------
template<class T> bool chmax(T& a, const T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T& a, const T b) { if (b < a) { a = b; return 1; } return 0; }
#define FOR(i,l,r) for (ll i = (l); i < (r); ++i)
#define RFOR(i,l,r) for (ll i = (r)-1; (l) <= i; --i)
#define REP(i,n) FOR(i,0,n)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define COUNT(c,v) count(ALL(c),(v))
#define SZ(c) ((ll)(c).size())
#define BIT(b,i) (((b)>>(i)) & 1)
#define PCNT(b) __builtin_popcountll(b)
#define CLZ(b) __builtin_clzll(b)
#define BITLEN(b) (64LL - CLZ(b))
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << "l." << __LINE__ << " : " << #x << " = " << (x) << '\n'
ll llceil(ll a, ll b) { return (a + b - 1) / b; }
string toupper(const string& S) { string T(S); REP(i,SZ(T)) T[i] = toupper(T[i]); return T; }
string tolower(const string& S) { string T(S); REP(i,SZ(T)) T[i] = tolower(T[i]); return T; }
using P = pair<ll,ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VVS = vector<VS>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VVVLL = vector<VVLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VVVB = vector<VVB>;
using VD = vector<double>;
using VVD = vector<VD>;
using VVVD = vector<VVD>;
using VLD = vector<ld>;
using VVLD = vector<VLD>;
using VVVLD = vector<VVLD>;
static const double EPS = 1e-10;
static const double PI  = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
static const ll INF = (1LL << 62) - 1;  // 4611686018427387904 - 1
// --------------------------------------------------------
// #include <atcoder/all>
// using namespace atcoder;


int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout << fixed << setprecision(15);

    ll N, M; cin >> N >> M;
    VLL X(M),Y(M),Z(M); REP(i,M) cin >> X[i] >> Y[i] >> Z[i];

    VVLL E(N+1);
    REP(i,M) {
        E[X[i]].push_back(i);
    }

    VLL dp(1<<N, 0); dp[0] = 1;
    REP(S,1<<N) {
        ll p = PCNT(S);

        bool ok = true;
        for (ll id : E[p]) {
            ll cnt = 0;
            REP(i,N) if (BIT(S,i)) {
                if (i+1 <= Y[id]) cnt++;
            }
            if (cnt > Z[id]) ok = false;
        }
        if (!ok) continue;

        REP(u,N) if (BIT(S,u)) {
            dp[S] += dp[S ^ (1<<u)];
        }
    }
    ll ans = dp[(1<<N)-1];
    COUT(ans);

    return 0;
}

/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2021.04.29 06:43:59
**/

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

int main() {
    int n,m;cin >> n >> m;
    vector<vector<pair<int,int>>> a(n+1);
    for (int i = 0; i < m; i++) {
        int x,y,z;cin >> x >> y >> z;
        a[y].push_back({x,z});
    }
    vector<ll> dp(1<<n);
    dp[0]=1;
    for (int i = 1; i < 1<<n; i++) {
        bool ok = true;
        for(auto [x,z] : a[__builtin_popcount(i)]) {
            if (__builtin_popcount((1<<x)-1&i) > z) {
                ok=false;
                break;
            }
        }
        if (!ok) { dp[i]=0; continue; }
        for (int j = 0; j < n; j++) if (i&1<<j) dp[i] += dp[i^(1<<j)];
    }
    cout << dp[(1<<n)-1] << endl;
    return 0;
}